The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A Descriptive Language for Symbol Manipulation
Journal of the ACM (JACM)
A formal semantics for computer languages and its application in a compiler-compiler
Communications of the ACM
Design of a separable transition-diagram compiler
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Control structures for programming languages
Control structures for programming languages
A Database Management System for the Federal Courts
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
A method is presented for parsing syntactic constructs that are permitted to appear independently anywhere in a program. Some examples include comments, macros, and constructs for conditional compilation. Each such construct is defined by its own grammar and parsed by a separate coroutine. The coroutine model of parsing allows the program text to be parsed in one pass despite the syntactic inconsistencies among the program text and the additional constructs. The usefulness of the model is demonstrated by showing how a production language parsing method is extended to handle multiple syntax specifications. The implementation of conditional compilation by carrying along two parses in a coroutine manner is also given. The utility of the model is further demonstrated by showing its adaptation to a recursive descent parser.