A general purpose macrogenerator Export

@article{citeulike:2551560, abstract = {The macrogenerator described in this paper is a symbol string processor, both its input and its output being strings of symbols. It operates by a form of substitution which is completely general in its application in that it is allowed anywhere. The result is a powerful system including such features as recursive functions and conditional expressions which can be implemented with very few instructions. Part 1 describes the operation of the macrogenerator and gives some indication of how it has been used at Cambridge. Part 2 contains a sufficiently detailed account of its implementation to make it a relatively simple task to transfer it to any suitable computer. Part 2 describes in some detail an implementation of the general purpose macrogenerator described in Part 1. The implementation is based on the use of a single stack and is described both as a series of transformations on the state of the stack, and by a CPL program. Various error checking features are described which greatly simplify the discovery of errors in macro programs. 10.1093/comjnl/8.3.225}, author = {Strachey, C.}, citeulike-article-id = {2551560}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/comjnl/8.3.225}, citeulike-linkout-1 = {http://comjnl.oxfordjournals.org/cgi/content/abstract/8/3/225}, day = {1}, doi = {10.1093/comjnl/8.3.225}, journal = {The Computer Journal}, keywords = {extensible-syntax, list-extensible-languages, macros}, month = {March}, number = {3}, pages = {225--241}, posted-at = {2008-03-18 14:52:49}, priority = {2}, title = {A general purpose macrogenerator}, url = {http://dx.doi.org/10.1093/comjnl/8.3.225}, volume = {8}, year = {1965} }

TY - JOUR ID - citeulike:2551560 L3 - citeulike-article-id:2551560 N2 - The macrogenerator described in this paper is a symbol string processor, both its input and its output being strings of symbols. It operates by a form of substitution which is completely general in its application in that it is allowed anywhere. The result is a powerful system including such features as recursive functions and conditional expressions which can be implemented with very few instructions. Part 1 describes the operation of the macrogenerator and gives some indication of how it has been used at Cambridge. Part 2 contains a sufficiently detailed account of its implementation to make it a relatively simple task to transfer it to any suitable computer. Part 2 describes in some detail an implementation of the general purpose macrogenerator described in Part 1. The implementation is based on the use of a single stack and is described both as a series of transformations on the state of the stack, and by a CPL program. Various error checking features are described which greatly simplify the discovery of errors in macro programs. 10.1093/comjnl/8.3.225 IS - 3 JF - The Computer Journal EP - 241 TI - A general purpose macrogenerator VL - 8 SP - 225 KW - extensible-syntax KW - list-extensible-languages KW - macros AU - Strachey, C PY - 1965/03/01/ UR - http://dx.doi.org/10.1093/comjnl/8.3.225 ER -