Simple LR parser

Summary

• A Simple LR parser or SLR parser is an LR parser for which the parsing tables are generated as for an LR(0) parser except that it only performs a reduction with a grammar rule A â?? w if the next symbol on the input stream is in the follow set of A (see LL parser for a definition of follow set). Such a parser can prevent certain shift-reduce and reduce-reduce conflicts (see LR parser) that occur in LR(0) parsers and it can therefore deal with more grammars.

Similar Topics

• Simple precedence parser
• LALR parser
• LL parser
• LR parser
• SIMPLE IRA
• GLR parser
• Simple set
• Canonical LR parser
• Inverse parser
• Simple Plan

Related Topics

• LL parser
• LR parser

  * This page is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Simple LR parser".