What is not true of Regular languages:
A: any finite language is regular
B: sentences in a regular language have a bounded length
C: only simple variables are needed to recognize
a regular language
D: the parse tree is linear
E: time to parse a regular language is O(n)
Most languages, including Regular languages, are infinite.
For example, a number or identifier is specified without a length bound.