Parser combinators for ambiguous left-recursive grammars (2007)
Cached
Download Links
- [cs.uwindsor.ca]
- [davinci.newcs.uwindsor.ca]
- DBLP
Other Repositories/Bibliography
by
Richard A. Frost
,
Rahmatullah Hafiz
,
Paul Callaghan
| Venue: | In ????, pages |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Frost07parsercombinators,
author = {Richard A. Frost and Rahmatullah Hafiz and Paul Callaghan},
title = {Parser combinators for ambiguous left-recursive grammars},
booktitle = {In ????, pages},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
