 | This article may be too technical for most readers to understand. (December 2024) |
 | It has been suggested that Simple precedence parser be merged into this article. (Discuss) Proposed since May 2025. |
| It has been suggested that Wirth–Weber precedence relationship be merged into this article. (Discuss) Proposed since May 2025. |
A simple precedence grammar is a context-free formal grammar that can be parsed with a simple precedence parser.[1] The concept was first created in 1964 by Claude Pair,[2] and was later rediscovered, from ideas due to Robert Floyd, by Niklaus Wirth and Helmut Weber who published a paper, entitled EULER: a generalization of ALGOL, and its formal definition, published in 1966 in the Communications of the ACM.[3]
- ^ The Theory of Parsing, Translation, and Compiling: Compiling, Alfred V. Aho, Jeffrey D. Ullman, Prentice–Hall, 1972.
- ^ Claude Pair (1964). "Arbres, piles et compilation". Revue française de traitement de l'information., in English Trees, stacks and compiling
- ^ Machines, Languages, and Computation, Prentice–Hall, 1978, ISBN 9780135422588,
Wirth and Weber [1966] generalized Floyd's precedence grammars, obtaining the simple precedence grammars.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search