English

A generalized parsing framework for Abstract Grammars

Computation and Language 2018-01-22 v3 Formal Languages and Automata Theory

Abstract

This technical report presents a general framework for parsing a variety of grammar formalisms. We develop a grammar formalism, called an Abstract Grammar, which is general enough to represent grammars at many levels of the hierarchy, including Context Free Grammars, Minimalist Grammars, and Generalized Context-free Grammars. We then develop a single parsing framework which is capable of parsing grammars which are at least up to GCFGs on the hierarchy. Our parsing framework exposes a grammar interface, so that it can parse any particular grammar formalism that can be reduced to an Abstract Grammar.

Keywords

Cite

@article{arxiv.1710.11301,
  title  = {A generalized parsing framework for Abstract Grammars},
  author = {Daniel Harasim and Chris Bruno and Eva Portelance and Martin Rohrmeier and Timothy J. O'Donnell},
  journal= {arXiv preprint arXiv:1710.11301},
  year   = {2018}
}

Comments

Technical Report [v2: added Martin Rohrmeier as author.] [v3: fixed error stating that AGs are equivalent to GCFGS. this is in fact not known yet. other minor typos fixed.]

R2 v1 2026-06-22T22:30:43.700Z