Simple precedence parser: Difference between revisions

Revision as of 12:47, 18 March 2008

Revision as of 01:37, 19 March 2008

Line 1:

{{Wikify|date=March 2008}}

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|Simple precedence grammars]]s.

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]]. Simbols <math>\lessdot</math>, <math>\dot =</math> and <math>\gtrdot</math> are used to identify the '''pivot''', and to know when to '''Shift''' or when to '''Reduce'''.

Line 70:

| $ ||<math>\lessdot</math>|| ||<math>\lessdot</math>||<math>\lessdot</math>||<math>\lessdot</math>|| || ||<math>\lessdot</math>|| ||<math>\lessdot</math> ||

|}

<pre>

Line 94 ⟶ 93:

</pre>

[[Category:Parsing algorithms]]

{{compu-lang-stub}}

[[Category:Parsing algorithms]]

[[es:Analizador sintáctico de precedencia simple]]