Jump to content

Simple precedence grammar

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by GregAsche (talk | contribs) at 01:50, 10 October 2005 (missing period(s) (You can help!)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A Simple precedence grammar is a context-free formal grammar that can be parsed with Simple precedence parser.

Formal definition

G = (N, Σ, P, S) is a Simple precedence grammar such that all the productions rules in P complies with the following constraints:

Examples

Example 1

precedence table:

S a b c
S
a
b
c