Simple precedence parser: Difference between revisions

Revision as of 11:43, 21 April 2008

Revision as of 13:12, 26 February 2009

Line 10:

* Start with a stack with only the '''starting marker''' $.

* Start with the string being parsed ('''Input''') ended with an '''ending marker''' $.

* While not (Stack equals to $S and Input equals to $) (S = Initial simbolsymbol of the grammar)

** Search in the table the relationship between Top(stack) and NextToken(Input)

** if the relationship is <Math> \dot =</math> or <Math>\lessdot</math>