Bug in calculation of follow sets resolved. All tests pass. Need more difficult cases to be sure.
Simplifying the calculation of follow sets. No links to the heads needed.
Restructuring grammar tests.
calculateLongestTerminalChain added to the grammar.
Refactoring the GLLParser class. Some sanity checks. The deepEquals method for ambiguous nodes should be fixed though
Adding filtering facilities to the grammar object. Making the client's life easier
Bug in the Grammar.filter method fixed.
an accumulator object is added to SPPFVisitor.
Switching from log4j to logback as the backend for slf4j. Eclipse bundles seem to work with logback.
Minor fixes. Log levels in GLLParser are set to trace.
Minor modifications. Test set for EBNF list added.
generateGraphWithPackedNodes added to AbstractGrammarTest
Adding the Parser interface, refactoring and cleanup. Test cases don't pass yet, but no compilation error.
DefaultSPPFVisitor is renamed to SPPFVisitorUtil and it's not a superclass of visitors. Favor composition over inheritance.
Visitors don't accept extra arguments. Accumulation and other stuff should be handled in the visitor itself.
Test case for A ::= epsilon passes.
Simple test cases added to check parse trees.
Bug in HeadGrammarSlot fixed.
ToString method in GrammarSlots fixed. Generating Java code from ambiguous SPPFs added.
Skeleton code for recognizers added.