greg
|
e870d8172a
|
Make = a keyword
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
72b26755a7
|
Make ParseResult just a normal Result type
No reason for it to be different
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
1416c9d444
|
Parse null as simple_expression
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
5c79563e53
|
Reduce binop args before reducing full expr
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
c27c900e7f
|
Add operators % and **
semantics for these are hard with floats handle later
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
50c5dbe96d
|
Evaluate simple binops
Woo this is kind of a neat milestone! I can now compute with this
language!
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
be8c8b3343
|
Add paren test
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
b856023072
|
Fixed paren parsing
also made error reporting a bit nicer
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
868373f409
|
use match syntax in simple_parse
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
582a7fd6dc
|
Make parse and tokens optional
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
a947ec3cb2
|
Add simple parsing test
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
79619025ea
|
Add directive to print precedence chart
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
56b338a6a8
|
Move to global precedence table
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
7d6f946e22
|
Fill out a few more precedences
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
0da7f7e3a1
|
Fully fixed binop parsing
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
19a344fa77
|
Fixed precedent-less binop parsing
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
626a7f3861
|
Working on binop parsing
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
8e3a571d67
|
.env dirctive to display environment
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
f88f115567
|
Environment persistent across repl loop
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
08f1092b69
|
Variable lookup works
Note this introduces a panic - if the AST node inserted into the
environment is not reduced, it throws an error when trying to look it up
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
6ddea790c0
|
Beginning of variable lookup
everything is null
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
6897eb1283
|
Implemented variable binding
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
34fdf2be00
|
Add machinery for evaluation environments
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
4ef93fafb5
|
Cause tokenize error for unclosed strings
|
2017-09-19 22:10:53 -07:00 |
|
greg
|
d2108f0f97
|
First pass at evaluation
Very incomplete
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
2989ac338c
|
Implemented binop parsing
Uses Operator-precedence parsing algorithm, which I don't fully
understand.
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
8b6d54aec2
|
Fix let clause parsing
let a = x, x should be expression not just simple expression
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
cdb47bb3b9
|
Add paren parsing
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
9d6dc5a5f2
|
Tokenize periods separately
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
8f9bfbc5bd
|
Rename rhs to simple_expression
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
c9fdd5e83c
|
Simplified statements-parsing
Still a little wonky wrt extraneous Separators, need to adjust grammar
to fix I think
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
30eddf7737
|
while statements
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
42719dc2f2
|
Change 'input' to 'tokens'
just to be consistent
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
8fcc850d77
|
Added else clause to if parsing
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
f421918945
|
basic if expression
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
0e4469fa58
|
Filled out keyword tokenizing
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
edf100b583
|
Starting to do if statement parsing
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
169e662049
|
Collapse Separator tokens
only ever gonna be one in a row
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
46999beabf
|
Added skeleton of expression() parser
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
1342a76786
|
Added support for interpreter directives
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
05238bced3
|
rhs production
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
a97cce184c
|
Empty program is valid too
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
329c521964
|
Parsing statement blocks works
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
bfa16fd6fb
|
Added Keyword lexical class
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
25f5188d8c
|
Move definition around
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
5213dd327f
|
Change type to peekable
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
cea29094cd
|
type alias for Tokens
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
67eafba97a
|
Put expect into early return macro
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
1059a88ee6
|
Separate parsing into module
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
429ace73bd
|
Move tokenizing into separate module
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
044e7a6a26
|
Rename ASTNode -> AST
saves typing
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
dbdae42c1b
|
Add string to AST
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
fc3dcf792d
|
Start writing recursive descent parser
I think I get the idea now
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
02b34ca105
|
Wrote expect()
Hopefully correctly?
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
9f4330889a
|
Starting parsing work
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
3058af4f05
|
Break on ctrl-D
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
4f17d5a0dc
|
Add number tokenizing
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
8e3774ffca
|
Comma as separate token
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
c6059ada7d
|
Separators and parens
Separator = ; or \n, they are equivalent
|
2017-09-19 22:10:52 -07:00 |
|
greg
|
2aaa600d53
|
More tokenizer stuff
|
2017-09-19 22:10:51 -07:00 |
|
greg
|
c6a92728ee
|
Scaffolding for evaluation function
|
2017-09-19 22:10:51 -07:00 |
|
greg
|
b2e23bed86
|
Print tokens and parse
|
2017-09-19 22:10:51 -07:00 |
|
greg
|
3fdacf018e
|
Basic repl
|
2017-09-19 22:10:51 -07:00 |
|
greg
|
6098bf84d6
|
Initial commit
|
2017-09-19 22:10:51 -07:00 |
|