Journal of Logic, Language and Information

, Volume 19, Issue 2, pp 201–228

PGF: A Portable Run-time Format for Type-theoretical Grammars

Article

DOI: 10.1007/s10849-009-9112-y

Cite this article as:
Angelov, K., Bringert, B. & Ranta, A. J of Log Lang and Inf (2010) 19: 201. doi:10.1007/s10849-009-9112-y
  • 65 Downloads

Abstract

Portable Grammar Format (PGF) is a core language for type-theoretical grammars. It is the target language to which grammars written in the high-level formalism Grammatical Framework (GF) are compiled. Low-level and simple, PGF is easy to reason about, so that its language-theoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering syntax, semantics, and parser generation. It also discusses the technique of embedded grammars, where language processing tasks defined by PGF grammars are integrated in larger systems.

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  • Krasimir Angelov
    • 1
  • Björn Bringert
    • 1
    • 2
  • Aarne Ranta
    • 1
  1. 1.Department of Computer Science and Engineering, Chalmers University of TechnologyUniversity of GothenburgGothenburgSweden
  2. 2.Google IncMountain ViewUSA

Personalised recommendations