Even faster generalized LR parsing |
| |
Authors: | John Aycock Nigel Horspool Jan Janou?ek Bo?ivoj Melichar |
| |
Affiliation: | (1) Department of Computer Science, University of Victoria, Victoria, B.C., Canada V8W 3P6 (e-mail: {aycock,nigelh}@csc.uvic.ca) , CA;(2) Department of Computer Science and Engineering, Czech Technical University, Karlovo nám. 13, 121 35, Prague, Czech Republic (e-mail: {janousej,melichar}@cs.felk.cvut.cz) , CZ |
| |
Abstract: | We prove a property of generalized LR (GLR) parsing – if the grammar is without right and hidden left recursions, then the
number of consecutive reductions between the shifts of two adjacent symbols cannot be greater than a constant. Further, we
show that this property can be used for constructing an optimized version of our GLR parser. Compared with a standard GLR
parser, our optimized parser reads one symbol on every transition and performs significantly fewer stack operations. Our timings
show that, especially for highly ambiguous grammars, our parser is significantly faster than a standard GLR parser.
Received: 9 May 2000 / 5 March 2001 |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|