Location of Repository

THESIS FOR THE DEGREE OF LICENTIATE OF ENGINEERING GF Runtime System

By Krasimir Angelov, Krasimir Angelov and C Krasimir Angelov

Abstract

Natural languages have been subject of studies for centuries and are hot topic even today. The demand for computer systems able to communicate directly in natural language places new challenges. Computational resources like grammars and lexicons and efficient processing tools are needed. Grammars are described as computer programs in declarative domain specific languages. Just like any other programming language they require mature compilers and efficient runtime systems. The topic of this thesis is the runtime system for the Grammatical Framework (GF) language. The first part of the thesis describes the semantics of the Portable Grammar Format (PGF). This is a low-level format which for GF plays the same role as the JVM bytecode for Java. The representation is designed to be as simple as possible to make it easy to write interpreters for it. The second part is for the incremetal parsing algorithm in PGF. The parser performance was always a bottle neck in GF until now. The new parser is of orders of magnitude faster than any of the previous implementations. The last contribution of the thesis is the developmen

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.362.9674
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.chalmers.se/~kr... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.