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

..

NodeTree.h

Implemented grammer loading

2013-05-20 19:34:15 -04:00

ParseAction.h

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

Parser.h

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

ParseRule.h

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

State.h

Modifed set creation to use a State object. Set creation works

2013-05-26 22:12:47 -04:00

StringReader.h

Implemented grammer loading

2013-05-20 19:34:15 -04:00

Symbol.h

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