Simple precedence parser: Difference between revisions

Revision as of 19:03, 16 October 2010

Revision as of 23:50, 4 December 2011

Line 2:

{{wikify|date=October 2010}}

In [[computer science]], a '''Simplesimple precedence parser''' is a type of [[bottom-up parser]] for [[context-free grammars]] that can be used only by [[Simplesimple 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>, <math>\dot =</math> and <math>\gtrdot</math> are used to identify the '''pivot''', and to know when to '''Shift''' or when to '''Reduce'''.