New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

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

Jump to bottom

idea: -g option for BNF style state aware grammar matching #14

Open

bool101 opened this issue Jun 2, 2015 · 0 comments

Assignees

Contributor

bool101 commented Jun 2, 2015

For some services it may be possible to write a BNF grammar to define valid inputs as a client transitions through states of the program

zachriggle assigned bool101

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment