Nathan Braswell
|
31d7c02ef9
|
Finished writing first code for turning the RNGLR recognizer into a parser. Doesn't compile yet, needs lots of bugfixing, but I'm calling it a night.
|
2013-08-08 02:44:17 -04:00 |
|
Nathan Braswell
|
680d978dcb
|
Problem was actually in grammer, fixed it. Also made identical rules with different lookahead merge. Now just started on creating parse trees. Stopping for night.
|
2013-08-06 01:49:45 -04:00 |
|
Nathan Braswell
|
9460bacf1c
|
Fixed some problems with grammer loading of null rules and rules non-terminals and terminals that had the same name
|
2013-08-04 14:24:20 -04:00 |
|
Nathan Braswell
|
d5b33efb22
|
Null rules work in RNGLR now, but there seems to be a bug where somehow some states/rules get no lookahead.
|
2013-08-02 15:21:42 -04:00 |
|
Nathan Braswell
|
49d149bc1f
|
RNGLR Recognizer now works for grammers without null rules.
|
2013-08-02 02:47:01 -04:00 |
|
Nathan Braswell
|
9887555dd5
|
Have almost got the RNGLR recognizer. Something is wrong with the GSS, I think when it's built. It seems to sometimes have parents as children, or something.
|
2013-07-31 23:51:05 -04:00 |
|
Nathan Braswell
|
3fba45591b
|
Changed Parser to be a virtual base class, inherited by LALRParser
|
2013-07-30 01:42:51 -04:00 |
|
Nathan Braswell
|
733fe1c08d
|
Changed Table to store vectors of actions, changed Parser appropriately.
|
2013-07-28 23:48:10 -04:00 |
|
Nathan Braswell
|
6d7b38a03b
|
More work towards RNGLR. First, NodeTree is now a template. Second, I've started writing the actual GLR parser and GSS and other things, but am still in the first write process.
|
2013-07-28 19:45:08 -04:00 |
|
Nathan Braswell
|
726ead0455
|
Pull out table to it's own Table class in prep for adding RNGLR algorithm.
|
2013-07-16 11:15:58 -04:00 |
|
Nathan Braswell
|
f84657f1ed
|
Fixed a lot of bugs. Actually gets through the entire experimental grammer. (A largeish experimental grammer for Kraken written to continue testing and to really start language development.
|
2013-07-10 23:50:53 -04:00 |
|
Nathan Braswell
|
1c85e3693e
|
Added support for null rules, works well.
|
2013-07-09 02:45:59 -04:00 |
|
Nathan Braswell
|
4c2fd967f0
|
Perens now work fully! The RegEx part of Kraken should now be fully legitimate. The only problem is not gracefully letting the user know about faulty input, but that goes for all of Kraken.
|
2013-07-07 02:13:05 -04:00 |
|
Nathan Braswell
|
502929963c
|
Added alternation and fixed a bug with the repetition operators exposed by the addition of the alternation. (for some reason the repetition operators used a loop making endless circles)
|
2013-07-04 15:10:32 -04:00 |
|
Nathan Braswell
|
84566c4ff6
|
Extended the Regular Expression class to now support * and ? as well as +. Next up, perens and alternation
|
2013-07-03 23:40:36 -04:00 |
|
Nathan Braswell
|
cc6ff21986
|
Fixed some bugs, including modifing StringReader to treat quoted strings as whole words.
|
2013-07-02 13:14:40 -04:00 |
|
Nathan Braswell
|
85da0bf646
|
Lexer/RegExs now work on a very basic level. Regular expressions have not been fully implemented, but the structure is there. It creates trivial regexs that only accept a specified sequence, no actual regular expression power.
|
2013-07-02 01:47:42 -04:00 |
|
Nathan Braswell
|
94a7739bd9
|
Added structure for Regular Expressions, saving work as a backup because of software upgrade.
|
2013-07-01 22:45:33 -04:00 |
|
Nathan Braswell
|
c2520ec2c4
|
NodeTree now also has a link to the Symbol it represents.
|
2013-06-27 23:45:38 -04:00 |
|
Nathan Braswell
|
6a2977d12a
|
Redid lookahead in a much much saner way. Now should be a legitimate parser somewhere between LALR(1) and LR(1).
|
2013-06-26 14:27:28 -04:00 |
|
Nathan Braswell
|
ee9b8b8c39
|
Modified the NodeTree with a unique id used in construction of the DOT representation, so that two different nodes with the same name don't end up as the same on the graph.
|
2013-06-23 05:54:58 -04:00 |
|
Nathan Braswell
|
a307e1f143
|
Changed followset to work on states, fixed many bugs. Kraken now should have a fairly legitimate LALR(1) parser. (null productions have not yet been added.)
|
2013-06-23 05:06:38 -04:00 |
|
Nathan Braswell
|
17dd186373
|
Fixed infinite loop bug- Was attempting to see if a non-closured state and a closured state were equal, almost never were.
|
2013-06-21 14:46:15 -04:00 |
|
Nathan Braswell
|
20b059ca45
|
Transfer computer
|
2013-06-21 14:16:16 -04:00 |
|
Nathan Braswell
|
66b88cb5d7
|
Added followSets(Symbol*) function to compute follow sets.
|
2013-06-13 23:43:12 -04:00 |
|
Nathan Braswell
|
da6e5f3de9
|
Added a firstSet(Symbol*) function that takes in a Symbol* and returns a vector of Symbol* s that are the first set of the first Symbol*.
|
2013-06-13 19:11:31 -04:00 |
|
Nathan Braswell
|
0c651a5d9e
|
Added EOF symbol, making the getTable() saner for ACCEPT and lookahead support in ParseRule
|
2013-06-13 14:25:10 -04:00 |
|
Nathan Braswell
|
949dbc532a
|
Fixed lots of bugs, added much more sane and efficient ParseAction table instead of recalculating every time. Fixed lots of bugs and inefficencies. Some temporary hacks in the table, mostly having to do with not having an EOF Symbol yet.
|
2013-06-04 19:50:16 -04:00 |
|
Nathan Braswell
|
0c4af245bf
|
Cleaned up some debug messages, parseInput(string) now returns a parse tree of NodeTree*. This is done by having each non-terminal Symbol have it's own subtree and calling a method to combine subtrees and terminals on each reduce. The output is now the DOT version of the parse tree.
|
2013-05-30 19:49:19 -04:00 |
|
Nathan Braswell
|
dd7b255520
|
Parser works! Parses LR(0) grammers. Fixed the never ACCEPT bug from last night.
|
2013-05-30 02:12:34 -04:00 |
|
Nathan Braswell
|
69713ffe1a
|
Actually parses LR(0) grammers and sentences\! Only two problems is very inefficint gotoTable() and actionTable(), and it REJECTS the sentence after completing the Goal->Sentence(*) production. However, need to go to bed now. Does practially work though\! Yay\!
|
2013-05-29 20:43:35 -04:00 |
|
Nathan Braswell
|
315dc55409
|
Modifed set creation to use a State object. Set creation works
|
2013-05-26 22:12:47 -04:00 |
|
Nathan Braswell
|
858daa30ee
|
Changed from iterators, which become invalidated if vector is changed, to classic indexing. Now runs! However, the results are incorrect. Closure seems to work through.
|
2013-05-24 13:24:33 -04:00 |
|
Nathan Braswell
|
1aec4ee6a7
|
Added first go at creating stateSets. This is a commit to save work, as it still segfaults.:
|
2013-05-24 00:00:41 -04:00 |
|
Nathan Braswell
|
e4f83cbb67
|
Added main loop of parser.
|
2013-05-23 01:35:54 -04:00 |
|
Nathan Braswell
|
14fc410e00
|
Added clone method and pointer location to toString in ParseRule
|
2013-05-20 23:26:15 -04:00 |
|
Nathan Braswell
|
200cff6ab4
|
Separate the toString and toDOT methods.
|
2013-05-20 22:59:57 -04:00 |
|
Nathan Braswell
|
d2698cf203
|
Implemented grammer loading
|
2013-05-20 19:34:15 -04:00 |
|
Nathan Braswell
|
46d59ac595
|
First work on Kraken! Basic node tree system re-written from WTS-Language, can output .gv files of the node tree.
|
2013-05-11 16:13:46 -04:00 |
|
Nathan Braswell
|
ced3f3ea37
|
Initial commit
|
2013-05-10 12:08:44 -07:00 |
|