6a2977d12aRedid lookahead in a much much saner way. Now should be a legitimate parser somewhere between LALR(1) and LR(1).
Nathan Braswell
2013-06-26 14:27:28 -04:00
ee9b8b8c39Modified 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.
Nathan Braswell
2013-06-23 05:54:58 -04:00
a307e1f143Changed 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.)
Nathan Braswell
2013-06-23 05:06:38 -04:00
17dd186373Fixed infinite loop bug- Was attempting to see if a non-closured state and a closured state were equal, almost never were.
Nathan Braswell
2013-06-21 14:46:15 -04:00
66b88cb5d7Added followSets(Symbol*) function to compute follow sets.
Nathan Braswell
2013-06-13 23:43:12 -04:00
da6e5f3de9Added 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*.
Nathan Braswell
2013-06-13 19:11:31 -04:00
0c651a5d9eAdded EOF symbol, making the getTable() saner for ACCEPT and lookahead support in ParseRule
Nathan Braswell
2013-06-13 14:25:10 -04:00
949dbc532aFixed 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.
Nathan Braswell
2013-06-04 19:50:16 -04:00
0c4af245bfCleaned 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.
Nathan Braswell
2013-05-30 19:49:19 -04:00
dd7b255520Parser works! Parses LR(0) grammers. Fixed the never ACCEPT bug from last night.
Nathan Braswell
2013-05-30 02:12:34 -04:00
69713ffe1aActually 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\!
Nathan Braswell
2013-05-29 20:43:35 -04:00
315dc55409Modifed set creation to use a State object. Set creation works
Nathan Braswell
2013-05-26 22:12:47 -04:00
858daa30eeChanged from iterators, which become invalidated if vector is changed, to classic indexing. Now runs! However, the results are incorrect. Closure seems to work through.
Nathan Braswell
2013-05-24 13:24:33 -04:00
1aec4ee6a7Added first go at creating stateSets. This is a commit to save work, as it still segfaults.:
Nathan Braswell
2013-05-24 00:00:41 -04:00
e4f83cbb67Added main loop of parser.
Nathan Braswell
2013-05-23 01:35:54 -04:00
14fc410e00Added clone method and pointer location to toString in ParseRule
Nathan Braswell
2013-05-20 23:26:15 -04:00
200cff6ab4Separate the toString and toDOT methods.
Nathan Braswell
2013-05-20 22:59:57 -04:00
46d59ac595First work on Kraken! Basic node tree system re-written from WTS-Language, can output .gv files of the node tree.
Nathan Braswell
2013-05-11 16:13:46 -04:00