3 ms·
> PDAs... are able to parse any context free grammar To be complete, _non-deterministic_ PDAs can recognize any context-free language. Afaik you can't use a no
by alecbenzer 14y ago
> PDAs... are able to parse any context free grammar
To be complete, _non-deterministic_ PDAs can recognize any context-free language. Afaik you can't use a normal, deterministic parser to recognize things like the language of all palindromes (which is context-free).
- charliesome 14y agoAh, thanks for the correction!