Simple precedence parser: Difference between revisions

Revision as of 23:17, 28 September 2007

Revision as of 21:16, 2 November 2007

Line 7:

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

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

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

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

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