Jump to content

Simple precedence parser

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bbb23 (talk | contribs) at 18:41, 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.


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.