We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
One awesome thing would be ability to nest pattern matches/calls within your grammar, like a PEG, Antlr, or even a Flex/Bison:
Example:
statement = [a-zA-Z0-9]+ statements = statement + statements
It might do this, just didn't see anything in the docs about it.
ps. awesome work on regex support!
The text was updated successfully, but these errors were encountered:
Yes this is fully supported (nerdy term for it is left hand recursion). STLR equivalent is:
statement = /[a-zA-Z0-9]+ / statements = statement statements
Although this could be done more efficiently as just
statement = /[a-zA-Z0-0]+ / statements = statement+
Sorry, something went wrong.
No branches or pull requests
One awesome thing would be ability to nest pattern matches/calls within your grammar, like a PEG, Antlr, or even a Flex/Bison:
Example:
It might do this, just didn't see anything in the docs about it.
ps. awesome work on regex support!
The text was updated successfully, but these errors were encountered: