...ANY language that uses arbitrarily nested parenthesis (as in to any level of nesting)...
the rest of your post is spot on (++) but this part i believe is wrong. arbitrarily nested parenthesis are a canonical example of a construct that can't be matched by a finite acceptor (DFA|NFA) but can easily be matched by a pushdown automata (just push everytime you see an open paren, pop everytime you see a closed paren), and hence are valid in context-free languages. almost every textbook on automata and formal languages i've seen uses that as the transition between the Regular Languages chapter and the Context-Free Languages chapter.
In reply to Re: Re: Re: Re: original definition vs final language
by thraxil
in thread original definition vs final language
by dystrophy
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |