A result on the relationship between simple precedence languages and reducing transition languages
James B. Morris · 1970
Two of the more recently published systems for the efficient parsing of subclasses of deterministic, context-free languages are the backwards-deterministic, (or unambiguous, as they were originally called) simple precedence languages due to Wirth and Weber, and the reducing transition languages due to Eickel, Paul, Bauer, and Samelson. The main result demonstrated in this paper is that the backwards-deterministic, simple precedence languages are a proper subclass of the reducing transition languages. The reducing transition languages are certainly a subclass of the deterministic, context-free (LR(1)) languages but it is not known if this inclusion is proper.