Opeartor-precedence v.s. LL(1)

Textbooks on compilers usually contain discussions about
the relationships between the other types of grammars.
I do not seem to come across a discussion regarding to
the grammars accepted by operator-precedence and LL(1)
(or recursive descent). Obviously, an inclusion relationship
does not exist, since (1) operator-precedence can parse
both left-recursive and/or ambiguous grammars while LL(1)
cannot, (2) LL(1) can parse grammars that have two adjacent
nonterminals at production right sides while the
operator-precedence cannot.


Two questions:


(1) What is the precise relationship between the two?


(2) Is there a language that can be parsed by one but not the
other?


--
Jingling XUE Email ejxue@ntuix.ntu.ac.sg
School of EEE Phone +65 799 1236
Nanyang Technological University Telex RS 38851 NTU
SINGAPORE 2263 Fax +65 791 2687
[The answer to (2) is clearly yes, since you've given examples. -John]
--

Return to the comp.compilers page.
Search the comp.compilers archives again.