Simple precedence parser: Difference between revisions

Revision as of 13:33, 26 February 2009

Revision as of 17:29, 23 May 2009

Line 5:

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'''.

== Implementation ==

* Compute the [[Wirth-Weber precedence relationship]] table.

Line 29:

* search in the productions of the grammar which one have the same right side than the '''Pivot'''

== Example ==

<pre>