Sciweavers

1064 search results - page 8 / 213
» Single Tree Grammars
Sort
View
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 7 months ago
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 me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
IANDC
1998
70views more  IANDC 1998»
13 years 7 months ago
The Generating Power of Total Deterministic Tree Transducers
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...
Sebastian Maneth
ACL
1996
13 years 8 months ago
Another Facet of LIG Parsing
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
Pierre Boullier
ESOP
2009
Springer
13 years 11 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish
JOLLI
2010
106views more  JOLLI 2010»
13 years 5 months ago
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
Makoto Kanazawa