Driven LR(1) Parser A Flexible Table - Towns

A flexible table driven LR(1) parser


Sorenson, Theory and Practice of Compiler Writing, McGraw-Hill, Inc., New York, NY, 1985 3 Alfred V. Systems for Automation of Engineering and Research SAER 2002, Varna, Bulgaria, pp 149--153. The LR(1) parsing algorithm is based on modified bottom up strategy described in [1] and it stays the same for all grammars. 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. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986 4 Alfred V. Ullman, Theory of Parsing, Translation and Compiling, Prentice Hall Professional Technical Reference, 1973 5 Bonev S., Implementation of LR(1) Parsers, Proc of the 16th Int.