If regular expressions were able to reference variables bound to other regex, they'd support full recursive context-free grammars.
-
-
I'd prefer first class Parsing Expression Grammars with a nice binding system.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Recursively expanding parse trees for sentences isn't unusual and are recursive cfg's. W/o heurstics cost n^3 to parse but cheap to expand.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.