Abstract
We present a new approach for the construction of NDR parsers, which defines a new form of items and keeps track of bounded sequences of subgraph connections. This improves the precise recovery of conflicts’ right-hand contexts over the basic looping approach, and thus allows to extend the class of accepted grammars. Acceptance of at least all LALR(k) grammars, for a given k, is guaranteed. Moreover, the construction needs no subgraph copies. Since bounded-graph and basic looping constructions only differ in the accuracy of the conflicts’ right-hand contexts computation, the NDR parsing algorithm remains unchanged.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Manuel E. Bermudez and Karl M. Schimpf. Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences, 41:230–250, 1990.
Pierre Boullier. Contribution á la construction automatique d’analyseurs lexi-cographiques et syntaxiques. PhD thesis, Université d’Orléans, France, 1984. In French.
Jacques Farré and José Fortes Gálvez. A basis for looping extensions to discriminating-reverse parsing. In M. Daley, M. G. Eramian, and S. Yu, editors, 5th International Conference on Implementation and Applications of Automata, CIAA 2000, pages 130–139, London, Ontario, 2000. The University of Western Ontario.
Jacques Farré and José Fortes Gálvez. A bounded-connect construction for LR-regular parsers. In R. Wilhelm, editor, International Conference on Compiler Construction, CC 2001, Lecture Notes in Computer Science #2027, pages 244–258. Springer-Verlag, 2001.
José Fortes Gálvez. Generating LR(1) parsers of small size. In Compiler Construction. 4th Internatinal Conference, CC’92, Lecture Notes in Computer Science #641, pages 16–29. Springer-Verlag, 1992.
José Fortes Gálvez. Experimental results on discriminating-reverse LR(1) parsing. In Peter Fritzson, editor, Proceedings of the Poster Session of CC’94-International Conference on Compiler Construction, pages 71–80. Department of Computer and Information Science, Linköping University, March 1994. Research report LiTH-IDA-R-94-11.
José Fortes Gálvez. A practical small LR parser with action decision through minimal stack suffix scanning. In Jürgen Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II, pages 460–465. World Scientific, 1996.
José Fortes Gálvez. A Discriminating Reverse Approach to LR(k) Parsing. PhD thesis, Universidad de Las Palmas de Gran Canaria and Université de Nice-Sophia Antipolis, 1998.
B. Seité. A Yacc extension for LRR grammar parsing. Theoretical Computer Science, 52:91–143, 1987.
Seppo Sippu and Eljas Soisalon-Soininen. Parsing Theory. Springer, 1988 and 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farré, J., Gálvez, J.F. (2002). Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-36390-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00400-4
Online ISBN: 978-3-540-36390-3
eBook Packages: Springer Book Archive