[#Blog] #regexp-tree: a regular expressions parser with a simple AST formathttps://medium.com/@DmitrySoshnikov/regexp-tree-a-regular-expressions-parser-with-a-simple-ast-format-bcd4d5580df6#.ubf2nxwu8 …
-
-
I for one would be interested in aligning the AST formats so any tooling (e.g. regjsgen) can be used universally
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
this looks great actually, not sure how I missed it. Although, I stoped writing manual recursive descents as long as LR works.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
it's faster, both in terms of implementation -- you just write a grammar, and might be in speed (since no recursion).
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
re: format -- I tried to follow production nodes from ES spec. E.g. regjsparser parses '(?=)' as a Group, while it's Assertion.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
also, I just took ES grammar as a basis, but not limited to it -- may wan to add lookbehind assertions, groups naming, comments,etc
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
but I really like the regjsgen, I'd like to have a similar thing, probably can do some adapter to transform ASTs to a single format
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.
JavaScript, HTML, CSS, HTTP, performance, security, Bash, Unicode, i18n, macOS.