GLL parse-tree generation

Research output: Contribution to journalArticlepeer-review

993 Downloads (Pure)


Backtracking techniques which are often used to extend recursive descent (RD) parsers can have explosive run-times and cannot deal with grammars with left recursion. GLL parsers are fully general, worst-case cubic parsers which have the recursive descent-like property that they are easy to write and to use for grammar debugging. They have the direct relationship with the grammar that an RD parser has. In this paper we give an algorithm for generating GLL parsers which build an SPPF representation of the derivations of the input, complementing our existing GLL recognition algorithm, and we show that such parsers and recognisers are worst-case cubic.
Original languageEnglish
Pages (from-to)1828–1844
Number of pages17
JournalScience of Computer Programming
Issue number10
Early online date7 Apr 2012
Publication statusPublished - 1 Oct 2013

Cite this