3 research outputs found
Tabular Parsing
This is a tutorial on tabular parsing, on the basis of tabulation of
nondeterministic push-down automata. Discussed are Earley's algorithm, the
Cocke-Kasami-Younger algorithm, tabular LR parsing, the construction of parse
trees, and further issues.Comment: 21 pages, 14 figure
Tabulation of Automata for Tree Adjoining Languages
We try to provide a common framework to clarify the relationships between different automata and their associated tabulation techniques for Tree Adjoning Languages, a subclass of Mildly Context-Sensitive Languages. We have chosen Logic Push-down Automata working with Linear Indexed Grammars as a starting point. Several tabulation techniques for different parsing strategies are proposed and compared with previous approaches. 1 Introduction The class of Mildly Context-Sensitive Languages (MCSL) is placed between context-free languages and context-sensitive languages. An important subclass in MCSL is that of Tree Adjoining Languages, which can be described by several grammar formalisms which have been shown to be equivalent with respect to their weak generative capacity (Vijay-Shanker and Weir, 1994): Tree Adjoining Grammars (Joshi and Schabes, 1997), Linear Indexed Grammars (Gazdar, 1987), Head Grammars (Pollard, 1984) and Combinatory Categorial Grammars (Steedman, 1986). Several parsi..
Tabulation of automata for tree adjoining languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the mechanism of tabulation. The parsing strategy is expressed in terms of the construction of a nondeterministic automaton from a grammar; three distinct types of automaton will be discussed. The mechanism of tabulation leads to the simulation of these nondeterministic automata in polynomial time, independent of the parsing strategy. The proposed application of this work is the design of efficient parsing algorithms for tree-adjoining grammars and related formalisms