Compiler construction: theory and practice (2nd ed.)
Compiler construction: theory and practice (2nd ed.)
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Efficient full LR(I) parser generation
ACM SIGPLAN Notices
Higher order attribute grammars
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
An LR substring parser for noncorrecting syntax error recovery
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Incremental generation of parsers
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Code generation using tree matching and dynamic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the modification of the formal grammar at parse time
ACM SIGPLAN Notices
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
USSA—universal syntax and semantics analyzer
ACM SIGPLAN Notices
Dynamic parsers and evolving grammars
ACM SIGPLAN Notices
Adaptive automata for context-dependent languages
ACM SIGPLAN Notices
Adaptive Rule-Driven Devices - General Formulation and Case Study
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Adaptable parsing expression grammars
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
| Hi-index | 0.00 |
In this article the formal definitions of modifiable grammars are presented, and the equivalence between classes of modifiable grammars and Turing machines is proved. Some criteria for reducing modifiable grammars to context-free grammars are provided. A lazy LR(1) algorithm for context-free grammars and an algorithm for constructing a LR(1) parser for modifiable grammars are discussed.