Simple precedence parser: Difference between revisions

Revision as of 23:54, 17 July 2007

Revision as of 23:57, 17 July 2007

Line 29:

* search the '''Pivot''' in the stack the nearest <Math> \dot <</math> from the top

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

= Example =

<pre>

Line 44 ⟶ 46:

<pre>

STACK PRECEDENCE INPUT ACTION

$ < 2 * ( 1 + 3 )$ SHIFT

$ < 2 > * ( 1 + 3 )$ REDUCE (F -> 2)

$ < F > * ( 1 + 3 )$ REDUCE (T -> F)

$ < T = * ( 1 + 3 )$ SHIFT

$ < T = * < ( 1 + 3 )$ SHIFT

$ < T = * < ( < 1 + 3 )$ SHIFT

$ < T = * < ( < 1 > + 3 )$ REDUCE 4 times (F -> 1) (T -> F) (T' -> T) (E -> T')

$ < T = * < ( < E = + 3 )$ SHIFT

$ < T = * < ( < E = + < 3 )$ SHIFT

$ < T = * < ( < E = + < 3 > )$ REDUCE 3 times (F -> 3) (T -> F) (T' -> T)

$ < T = * < ( < E = + = T > )$ REDUCE (E -> E + T)

$ < T = * < ( < E = )$ SHIFT

$ < T = * < ( = E = ) > $ REDUCE (F -> ( E ))

$ < T = * = F > $ REDUCE (T -> T * F)

$ < T > $ REDUCE 2 times (T' -> T) (E -> T')

$ < E > $ ACCEPT

</pre>