[Solved] Any Language that can be generated LL1 Grammar is regular. True/False
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 … Read more