Simple precedence parser: Difference between revisions

Revision as of 10:58, 23 March 2013

Revision as of 02:08, 16 March 2014

Line 4:

==Implementation==

* Compute the [[Wirth-WeberWirth–Weber precedence relationship]] table.

* Start with a stack with only the '''starting marker''' $.

* Start with the string being parsed ('''Input''') ended with an '''ending marker''' $.

Line 90:

==References==

* Alfred V. Aho, Jeffrey D. Ullman (1977). ''Principles of Compiler Design''. 1st Edition. Addison-WesleyAddison–Wesley.

* William A. Barrett, John D. Couch (1979). ''Compiler construction: Theory and Practice''. Science Research Associate.

* Jean-Paul Tremblay, P. G. Sorenson (1985). ''The Theory and Practice of Compiler Writing''. McGraw-HillMcGraw–Hill.

{{DEFAULTSORT:Simple Precedence Parser}}