Precedence Parser (other)
Precedence parser may refer to: * Simple precedence parser 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 grammars. The implementation of the parser is quite similar to the generic bottom-up parser. A stack ... * Operator precedence parser {{dab ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  

Simple Precedence Parser
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 grammars. 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. The symbols ⋖, ≐ and ⋗ are used to identify the pivot, and to know when to Shift or when to Reduce. Implementation * Compute the Wirth–Weber precedence relationship table for a grammar with initial symbol S. * Initialize a stack with the starting marker $. * Append an ending marker $ to the string being parsed (Input). * Until Stack equals "$ S" and Input equals "$" ** Search the table for the relationship between Top(stack) and NextToken(Input) ** if the relationship is ⋖ or ≐ *** Shift: *** Push(Stack, relationship) *** Push(Stack, NextToken(Input)) *** RemoveNextToken(Input) ** if the relationship is ⋗ *** Reduce: *** SearchProductio ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]