* Added bencher intra- and inter-procedural suits
 * Added Dockerfile

* Left Recursive Grammars transformed to Right Recursive avoiding infinite T generations with suffix analysis
* Grammar.printGrammarInFile

* Measured the generation time of the different graph edges
* Added EKnife.timedRun to evaluate the slicer against all the possible slicing criteria of a program
* Added intraprocedural bencher suite

* Measured the generation time of the different graph edges
* Added EKnife.timedRun to evaluate the slicer against all the possible slicing criteria of a program
* Added intraprocedural bencher suite

* Repeated recursive grammar states ignored in summary generation
* Increased the number of constraints that the stack can contain to 20
* Slice of 3 benchmarks improved

* LiteralConstraint in switch structures

* LiteralConstraint and its stack behaviour implemented

* Fix CFG absorbent clauses

Use '-DedgeNAME=false', where NAME can be structural, controlflow, control, flow, objectflow, value, valuestructure, totaldefinition, call, input, output or summary.

* Added clarifying comma to help message.

* Now generating fat jars via maven
* Packaging of scripts via Makefile
* Fix detection of scripts file
* Updated README
* Disabled printing in Flusher
* Removed iml project files
* Added optional printing of the graph (to dot or pdf)

* Arity added to tuple elements
* Stack states correctly updated (considers the previous traversed edge to differentiate states)

- Generators implicit and explicit restrictions are now more accurately treated
- Created +-[]S (List structure constraints)
- Created +-{}S (Tuple structure constraints)
- New kind of edges (ValueStructural Edges)
- Prevented the interference of the traversal of (Black) Structural Edges with other edges

* .erl -> original program
* .criterion -> slicing criterion (line var)
* .goldStandard -> minimal slice
* .sliced -> slice computed by the slicer