Parser experiment1 #15
Open
Conversation
This file contains hidden or 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
ratmice
force-pushed
the
parser-experiment1
branch
6 times, most recently
from
066b8a5 to
c8a5980
Compare
ratmice
force-pushed
the
parser-experiment1
branch
from
c8a5980 to
e53c187
Compare
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.
This branch is WIP towards a fairly non-standard syntax for natural deduction,
there is some examples, which augment the traditional natural deduction inference rules with placeholder the syntax, and some proofs in that syntax
It removes the existing AST while working on the parser since its a pain to fiddle with.
Natural deduction is weird, because it's got 'mid-line' which is some n-ary operator, and case expressions, also a n-ary operator.
It should be noted that this is not producing a very usable form of parse tree, hence experiment.
This is an attempt to use the
therefore sign ∴,
case analysis is done with '▸'.
'.' for discharge.
adds new tests
fix old tests for existing parser.
add new ast?
produces a nice usable parse tree?