Skip to main content
Article thumbnail
Location of Repository

ABSTRACT Polish Parsers, Step by Step

By R. John and M. Hughes

Abstract

We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and efficiently handle ambiguous grammars. The underlying techniques can be applied in many contexts where traditionally backtracking is used. We present two data types, one for keeping track of the progress of the search process, and one for representing the final result in a linear way. Once these data types are combined into a single type, we can perform a breadth-first search, while returning parts of the result as early as possible

Topics: breadth-first search, Polish representation, ambiguous grammars, online results
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.4990
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.cs.uu.nl/groups/ST/... (external link)
  • Suggested articles


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