Let X be a formal language expressed in a symbolic predicate notation. Tool Y is a symbolic grammar tool if it can generate parsers and pretty printers for X.


In the figure Symbolic langauge to abstract Java is defined. All of its clause types are clauses. All references are type clause. This simplification makes programming reverse engineering tools rather easy.

The language Symbolic is the carrier of all information in the methodology of this blog.