Compiling Declarative Specifications of Parsing Algorithms

12 years 3 months ago
Compiling Declarative Specifications of Parsing Algorithms
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. In this work, we present a compilation technique allowing the automatic transformation of parsing schemata to efficient executable implementations of their corresponding algorithms. Our technique is general enough to be able to handle all kinds of schemata for context-free grammars, tree adjoining grammars and other grammatical formalisms, providing an extensibility mechanism which allows the user to define custom notational elements.
Carlos Gómez-Rodríguez, Jesús
Added 14 Aug 2010
Updated 14 Aug 2010
Type Conference
Year 2007
Where DEXA
Authors Carlos Gómez-Rodríguez, Jesús Vilares, Miguel A. Alonso
Comments (0)