Tags: Programming Language.

In computer science a simple precedence parser is a type of bottom-up parser for context-free grammars that can be used only by simple precedence grammars.The implementation of the parser is quite similar to the generic bottom-up parser. A stack is used to store a viable prefix of a sentential form from a rightmost derivation. Symbols and are used to identify the pivot and to know when to Shift or when to Reduce.

Loading...

This page contains content from the copyrighted Wikipedia article "Simple precedence parser"; that content is used under the GNU Free Documentation License (GFDL). You may redistribute it, verbatim or modified, providing that you comply with the terms of the GFDL.