A general purpose macro processor is a macro processor that is not tied to or integrated with a particular language or piece of software.
A macro processor is a program that copies a stream of text from one place to another, making a systematic set of replacements as it does so. Macro processors are often embedded in other programs, such as assemblers and compilers. Sometimes they are standalone programs that can be used to process any kind of text.
Macro processors have been used for language expansion (defining new language constructs that can be expressed in terms of existing language components), for systematic text replacements that require decision making, and for text reformatting (e.g. conditional extraction of material from an HTML file).
Contents |
| Name | Year | Description |
|---|---|---|
| GPM | 1960s | One of the earliest macro processors was GPM (the General Purpose Macrogenerator).[1] This was developed at the University of Cambridge, UK, in the mid 1960s. |
| ML/I | 1960s | One particularly important general purpose macro processor was (and still is) ML/I (Macro Language One). This was developed as part of PhD research by a Cambridge postgraduate, Peter J. Brown. ML/I operates on a character stream, and requires no special format for its input, nor any special flag characters to introduce macros. |
| STAGE2 | 1960s | A contemporary of ML/I was STAGE2, part of William Waite's Mobile Programming System. This too is a general purpose macro processor, but it processes input a line at a time, matching each line against specified patterns. |
| GMP | Another attempt was the GMP (General Macro Processor) developed in the mid-1970s by M Boule in the DLB/GC department of the CII Company along ideas from R.J. Chevance. Tested in association with the Bordeaux I University the first version ran the SIRIS8/IRIS80 System. It was ported to mini6 systems and was the main component involved in the system generation for this family of computers. The GMP processor used C2-Chomsky grammars to define the syntax of macros and used and imperative language to execute computations and proceed to macro expansion. | |
| gema | gema is a contextual macro processor based on pattern matching. It replaces/enhances the concept of regular expressions by contexts. Contexts roughly corresponds to named sets of patterns. As a consequence, macros in gema closely resemble an EBNF description. | |
| GPP | gpp is another general macro processor written by Denis Auroux. It resembles a C preprocessor, but has more general semantics and allows for customized syntax (for instance, TeX, XHTML, and Prolog-like scripts are definable). | |
| pyexpander | 2011 | pyexpander is a general purpose macro processor based on the Python programming language. In addition to simple macro replacement it allows evaluation of arbitrary python expressions and execution of python code making pyexpander Turing Complete. |
| XPOP | XPOP was another attempt at a general macro processing language by Mark Halpern at IBM in the 1960s. | |
| M4 | m4 was designed for Unix by Brian Kernighan and Dennis Ritchie. | |
| minimac | minimac is a minimalist general purpose macro processor. It operates as a character stream filter, recursively expanding macros as they are encountered. It is unusual for a macro processor in that it uses an explicit argument stack, and user functions are defined by concatenation (similar to the Forth language). | |
| SNOBOL | 1960s |
SNOBOL is a string processing language which is capable of doing most of the pre-processing which can be done by a macro processor. |
| ELENA | Software: Practice and Experience, Vol. 14, pp. 519–531, Jun. 1984 |