Simple precedence parser: Difference between revisions

Revision as of 12:24, 27 September 2010

Revision as of 19:03, 16 October 2010

Line 1:

{{Unreferenced|auto=yes|date=December 2009}}

{{wikify|date=October 2010}}

In computer science, a '''Simple precedence parser''' is a type of [[bottom-up parser]] for [[context-free grammars]] that can be used only by [[Simple precedence grammar]]s.

Line 9 ⟶ 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 symbol 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>