On Predictive Parsing and Extended Context-Free Grammars
- 449 Downloads
Extended context-free grammars are context-free grammars in which the right-hand sides of productions are allowed to be any regular language rather than being restricted to only finite languages. We present a novel view on topdown predictive parser construction for extended context-free grammars that is based on the rewriting of partial syntax trees. This work is motivated by our development of ECFG, a Java toolkit for the manipulation of extended contextfree grammars, and by our continuing investigation of XML.
KeywordsActive Node Regular Language Input String Semantic Action Syntax Tree
Unable to display preview. Download preview PDF.
- 1.A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, Reading, MA, 1986.Google Scholar
- 2.J. Albert and Th. Ottmann. Automaten, Sprachen und Maschinen. Bibliographisches Institut, Mannheim, 1983.Google Scholar
- 3.T. Bray, J. P. Paoli, and C.M. Sperberg-McQueen. ExtensibleMarkup Language (XML) 1.0. http://www.w3.org/TR/1998/REC-xml-19980210/, February 1998.
- 7.A. Brüggemann-Klein and D. Wood. On predictive parsing and extended context-free grammars, 2002. Proceedings of the International Conference CIAA 2002. To appear.Google Scholar
- 8.A. Brüggemann-Klein and D. Wood. On predictive parsing and extended context-free grammars: Algorithms and complexity results, 2002. Manuscript in preparation.Google Scholar
- 9.J. Clark, 1992. Source code for SGMLS. Available by anonymous ftp from ftp.uu.net and sgml1.ex.ac.uk.Google Scholar
- 11.D. Giammarresi and D. Wood. Transition diagram systems and normal form transformations. In Proceedings of the Sixth Italian Conference on Theoretical Computer Science, pages 359–370, Singapore, 1998. World Scientific Publishing Co. Pte. Ltd.Google Scholar
- 17.J. Lewi, K. de Vlaminck, E. Steegmans, and I. van Horebeek. Software Develepment by LL(1) Syntax Description. John Wiley & Sons, Chichester, UK, 1992.Google Scholar
- 18.H. Mössenböck. A generator for production quality compilers. In Lecture Notes in Computer Science 471, Berlin, 1990. Springer-Verlag. Proceedings of the Third InternationalWorkshop on Compiler-Compilers.Google Scholar
- 20.S. Sippu and E. Soisalon-Soininen. Parsing Theory, Volume 1, Languages and Parsing, Volume 2, LL(k) and LR(k) Parsing,. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.Google Scholar
- 21.P. D. Terry. Compilers and Compiler Generators. Out of print, available on the Web, 2000.Google Scholar
- 22.J. Warmer and S. Townsend. The implementation of the Amsterdam SGML parser. Electronic Publishing, Origination, Dissemination, and Design, 2:65–90, 1989.Google Scholar
- 23.J. Warmer and H. van Vliet. Processing SGML documents. Electronic Publishing, Origination, Dissemination, and Design, 4(1):3–26, March 1991.Google Scholar