* Statistical functions to build tables

 * 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

* LiteralConstraint in switch structures

* Fix CFG absorbent clauses

* 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

* Erlang script path defined
* Fixes in code generation: some sliced expressions removed instead of replaced
* Fix guard stacks in CFG generation
* Logic simplification in Node-Result creation process
* Fixed dead clause detection
* Improvements added to summary generation:
    + Function calls associated to a particular formal-out-formal-in summary edge are only repended when the grammar term is created, and not for each added production
    + The list of constraints stacked after an AsteriskConstraint are removed when another AsteriskConstraint is pushed to the stack

* Traversal restriction of Generator value edge traversal
* CFG limitation for unreachable code

* The CFG ignores unreachable clauses in if expressions
* High order call slicing improved
* Fix Anonymous routines lack of value dependencies

* AdHoc anonymous function calls (fun(X)-> X+1 end(5))
* Named anonymous function / function calls

* Anonymous functions considered (fun(X) -> ... end)
* Shadowing in Anonymous Functions and LCs improved

* ast.erl and saver.erl has been moved to e-knife resources folder
* CFG and Value arcs are now in e-Knife
* CFGs are built with a the visitor pattern
* The graph library is now jgrapht
* CFGs of the clauses of the same method are now independent
* Interprocedural clause matching has been improved to not link unreachable clauses
* Shadowed variables and its value are now delimited to their context
* Classic algorithm has been added to slicing computed algorithms