To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

PGF: A Portable Run-time … - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

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

Journal article
Authors Krasimir Angelov
Björn Bringert
Aarne Ranta
Published in Journal of Logic, Language and Information
Volume 19
Issue 2
Pages 201-228
ISSN 0925-8531
Publication year 2010
Published at Department of Computer Science and Engineering, Computing Science (GU)
Pages 201-228
Language en
Subject categories Computer science


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.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?