Stoyan Bonev
ABSTRACT
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.
- Yankov B., Translators and Operating Systems, Sofia, Tehnika Publ., 1993, (in Bulgarian).Google Scholar
- Tremblay J. P., P. Sorenson, The Theory and Practice of Compiler Writing, McGraw Hill Book Company, 1985. Google ScholarDigital Library
- Aho A., R. Sethi, J. Ullman, Compilers, Principles, Techniques and Tools, Addison Wesley Publishing Company, 1986. Google ScholarDigital Library
- Aho A., J. Ullman, The Theory of Parsing, Translation and Computing, vol. 1, 2, Prentice Hall, 1973. Google ScholarDigital Library
- Bonev S., Implementation of LR(1) Parsers, Proc of the 16th Int. Conf. Systems for Automation of Engineering and Research SAER 2002, Varna, Bulgaria, pp 149--153.Google Scholar
Comments