Parser Combinators for Ambiguous Left-Recursive Grammars

  • Richard A. Frost
  • Rahmatullah Hafiz
  • Paul Callaghan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4902)

Abstract

Parser combinators are higher-order functions used to build parsers as executable specifications of grammars. Some existing implementations are only able to handle limited ambiguity, some have exponential time and/or space complexity for ambiguous input, most cannot accommodate left-recursive grammars. This paper describes combinators, implemented in Haskell, which overcome all of these limitations.

Keywords

Parser combinators ambiguity left recursion functional programming natural-language parsing 

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

  • Richard A. Frost
    • 1
  • Rahmatullah Hafiz
    • 1
  • Paul Callaghan
    • 2
  1. 1.School of Computer ScienceUniversity of WindsorCanada
  2. 2.Department of Computer ScienceUniversity of DurhamU.K.

Personalised recommendations