Compiling Declarative Specifications of Parsing Algorithms

  • Carlos Gómez-Rodríguez
  • Jesús Vilares
  • Miguel A. Alonso
Conference paper

DOI: 10.1007/978-3-540-74469-6_52

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4653)
Cite this paper as:
Gómez-Rodríguez C., Vilares J., Alonso M.A. (2007) Compiling Declarative Specifications of Parsing Algorithms. In: Wagner R., Revell N., Pernul G. (eds) Database and Expert Systems Applications. DEXA 2007. Lecture Notes in Computer Science, vol 4653. Springer, Berlin, Heidelberg

Abstract

The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing the automatic transformation of parsing schemata to efficient executable implementations of their corresponding algorithms. Our technique is general enough to be able to handle all kinds of schemata for context-free grammars, tree adjoining grammars and other grammatical formalisms, providing an extensibility mechanism which allows the user to define custom notational elements.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Carlos Gómez-Rodríguez
    • 1
  • Jesús Vilares
    • 1
  • Miguel A. Alonso
    • 1
  1. 1.Departamento de Computación, Universidade da Coruña (Spain), Campus de Elviña, s/n - 15071 A CoruñaSpain)

Personalised recommendations