Generalised Parsing: Some Costs [chapter]

Adrian Johnstone, Elizabeth Scott, Giorgios Economopoulos
2004 Lecture Notes in Computer Science  
We discuss generalisations of bottom up parsing, emphasising the relative costs for real programming languages. Our goal is to provide a roadmap of the available approaches in terms of their space and time performance for programming language applications, focusing mainly on GLR style algorithms. It is well known that the original Tomita GLR algorithm fails to terminate on hidden left recursion: here we analyse two approaches to correct GLR parsing (i) the modification due to Farshi that is
more » ... rporated into Visser's work and (ii) our own right-nullable GLR (RNGLR) algorithm, showing that Farshi's approach can be expensive. We also present results from our new Binary RNGLR algorithm which is asymptotically the fastest parser in this family and show that the recently reported reduction incorporated parsers can require automata that are too large to be practical on current machines.
doi:10.1007/978-3-540-24723-4_7 fatcat:5coet3nt4ne47fvbf6igfd6ah4