Jump to content

Simple precedence grammar

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bbb23 (talk | contribs) at 18:42, 8 July 2012 (unsourced and tagged since 2009 - removed all but first sentence). 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 a simple precedence parser.