Test cases via builtin strings, Ability to take a subalphabet #21
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Added support for using the builtin
Char(unicode) alphabetAdded the ability to take a subalphabet of a given alphabet
The unicode support allows you to write tests via ordinary strings. See the bottom of
Examples.Dyckfor a demonstration where I create a second alphabet that is a subset of unicode characters (namely'('and')', prove this new alphabet is iso to the original bracket, and use that iso to easily write strings for testsI did this to stress test the parsers on large input, hence the name of the branch. In Dyck, the
BalancedStkTrparser can handle input of ~20k characters in about 30 seconds.