Simple precedence parser: Difference between revisions

Revision as of 23:34, 15 February 2021

Revision as of 23:36, 15 February 2021

Line 1:

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 grammar]]s.

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 <math>\lessdot</math>&ltdot;, <math>\dot =</math>&esdot; and <math>\gtrdot</math>&gtdot; are used to identify the '''pivot''', and to know when to '''Shift''' or when to '''Reduce'''.

==Implementation==