Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Theory and Practice of Compiler Writing
Theory and Practice of Compiler Writing
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
A tale of three LR(1) syntax analyzers
CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
| Hi-index | 0.00 |
The implementation of a flexible table driven LR(1) parser is presented in this paper. The LR(1) parsing algorithm is based on modified bottom up strategy described in [1] and it stays the same for all grammars. A parser with control tables that are initialized within the source text has no flexibility because each new LR(1) parser implementation needs to recompile the source text in order to adjust its data control structures like terminal symbols, non terminal symbols, grammar rules and control table. To avoid this drawback a configuration text edited file is to be created and read as input to adapt the parser before the syntax analysis process starts execution.