|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
TABuildPhase | TODO insert comment here |
TAState | TODO insert comment here |
Class Summary | |
ElementAutomata | Contains the methods to build and show the automata associated to the elements of the symbol table (types, patterns, expressions). |
PatternMatching | Contains the run-time pattern matching algorithm. |
SemanticChecks | Contains the semantic error checking. |
TA | Tree automata are just like normal string automata but elements are trees instead of characters. |
TADifference | TODO insert comment here |
TADifferenceState | TODO insert comment here |
TAProduct | TODO insert comment here |
TASimple | Tree automata built from this class are either based upon an element of the symbol table of the program (that can be a pattern, a type, a variable or an expression) or the union of a set of these elements. |
TAUnion | TODO insert comment here |
Translate | Provides several transform operations to the symbol table. |
WellFormedness | Provides some well-formedness checks on type expressions and patterns. |
This package contains the classes that process the output of the parser and that perform static checking of the program. It also contains the pattern matching algorithm executed at run-time.
Note that to separate the semantic checks from the run-time algorithms in two distinct packages is almost impossible as run-time algorithms use the same data structure as static algorithms do (the tree automata).
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |