Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
AID: An alternative implementation of DCBs
New Generation Computing
Parsing and compiling using Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Parsing of Deterministic Languages
Journal of the ACM (JACM)
Bounded context syntactic analysis
Communications of the ACM
Modern Compiler Implementation: In ML
Modern Compiler Implementation: In ML
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Computational properties of principle-based grammatical theories
Computational properties of principle-based grammatical theories
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Compiler Construction in Higher Order Logic Programming
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
| Hi-index | 0.03 |
This paper addresses efficient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for "bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser specification. A working parser generator for λProlog is described, although the basic parsing mechanism is applicable to logic programming in general.