Modification of the definition of precedence grammars to eliminate precedence conflicts of certain classes of grammars is emphasized, and a method for resolving precedence conflicts for other classes of grammars is described. Grammars which satisfy the augmented definition are designated as context resolvable grammars. In addition, the necessary generating algorithm for determining if a grammar is context resolvable is presented, then the associated parsing algorithm is developed. Finally, the generality of context resolvable grammars is discussed.
展开▼
