Handbook of formal languages, vol. 3
An efficient context-free parsing algorithm
Communications of the ACM
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Dyna: a declarative language for implementing dynamic programs
ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
Deterministic left corner parsing
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Generating XTAG parsers from algebraic specifications
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Generation of indexes for compiling efficient parsers from formal specifications
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
| Hi-index | 0.00 |
The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamental semantics 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.