4 ms·
Can I see the (implied) counter-example? A regex which turns a language's source code into an AST?
by mrkeen 2y ago
Can I see the (implied) counter-example?
A regex which turns a language's source code into an AST?
- thaumasiotes 2y agoWhat implied counterexample? Regular expressions define the simplest language type a CS education generally covers. You would expect anything to be more capable. But you wouldn't prove it by demonstrating that you can recognize regular languages. That's the thing regular expressions are good at!