LALR parser : LALR |
||
|
An LALR parser or Look-ahead LR parser is a specific type of LR parser that can deal with more context-free grammars than SLR parsers but less than LR(1) parsers can. It is a very popular type of parser because it gives a good trade-off between the number of grammars it can deal with and the size of the parsing tables it requires. It is these types of parsers that are generated by compiler-compilers such as yacc and GNU bison.
The LALR algorithm for generating a parsing table... yet to write .... |
||
Put this code on your site |
||