[Solved] Any Language that can be generated LL1 Grammar is regular. True/False

Question

No. For example, take the following grammar:

E  ->  TE' | T
E' -> +TE' | -TE' | T
T  ->  FT' | F
T' -> *FT' | /FT' | F
F  ->  cte | (E)

It is the well known grammar for arithmetic expressions, written in LL(1) form. It is also a well known non-regular language, since it contains a Dick language (balanced parenthesis). This is of course not a formal proof that such language is not regular, but the proof is not very difficult, using the pumping lemma, and it should be easy to find on the web.

Accepted Answer

No. For example, take the following grammar:

E  ->  TE' | T
E' -> +TE' | -TE' | T
T  ->  FT' | F
T' -> *FT' | /FT' | F
F  ->  cte | (E)

It is the well known grammar for arithmetic expressions, written in LL(1) form. It is also a well known non-regular language, since it contains a Dick language (balanced parenthesis). This is of course not a formal proof that such language is not regular, but the proof is not very difficult, using the pumping lemma, and it should be easy to find on the web.