Automatic generation of multiple exit parsing subroutines
The parser construction method presented here might be characterized as the offspring of the successful marriage of LR(k) methodology  with the transition diagram systems of Conway . Like transition diagram systems, the parsers constructed by the method presented here, called the LLP(k) method, consist of small, finite state automata linked by "subroutine calls" and provide a mixed top-down/bottom-up parse. Transition diagram systems with one exit state per diagram correspond to top-down parsers and have been extensively studied [6,9,10]. Like Conway's transition diagrams, however, LLP(k) subroutines can parse multiple non-terminals simultaneously and return an indication of what they have discovered. It has been shown  that transition diagram systems composed of such multiple exit diagrams can parse all deterministic context free languages. Further, LLP(k) parsers can be realized as directly executing (non-interpretive) subroutines. The method has been implemented . The results demonstrate the feasibility of the approach.
KeywordsProduction Chain Parse Tree Production Expression Input String Finite State Automaton
Unable to display preview. Download preview PDF.
- 1.Backes, S., Top-down syntax analysis and Floyd-Evans production language. Information Processing 71, 504–517.Google Scholar
- 8.Lomet, D. B., The construction of efficient deterministic language processors. Ph.d. diss., University of Pennsylvania, Philadelphia, Pa., December, 1969 and IBM Research Report RC 2738, January, 1970.Google Scholar
- 9.Rosenkrantz, D. J. and Stearns, R. E., Properties of deterministic top-down grammars. ACM Symposium on theory of computing, Marina del Rey, California, May 1969, 165–180.Google Scholar
- 10.Tixier, V., Recursive functions of regular expressions in language analysis. Tech. Rep. CS-58, Computer Science Department, Stanford University, Stanford, California, March, 1967.Google Scholar