© 1974 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Symmetrical precedence relations on general phrase structure grammars
Department of Computing and Control, Imperial College of Science and Technology, 48 Princes Gardens, London, UK
In this paper precedence relations are defined on general phrase structure grammars. Unlike the formulations used for context free grammars four precedence relations are used and these are symmetrically defined. A two stack parsing method for simple precedence phrase structure languages is presented. An algorithm to transform any phrase structure grammar to precedence form is also described.
Received April 1973.
* Department of Computing and Control, Imperial College of Science and Technology, 48 Princes Gardens, London, SW7 1LU