|
Class Summary |
| AbstractStatement |
AbstractStatement has methods for reordering a relation after a
given format |
| AndStatement |
The AndStatement represents the and operation over two tables. |
| ConstraintStatement |
A ConstraintStatement is a expression to query. |
| Fact |
this is the base implementation for a relation with a name.
prolog: myFact(dan,joe).
in this example, "myFact" is the name and the parameters "dan" and "joe"
are the atoms in the relation. |
| FactDb |
the fact database stores all data found in the prolog program.
it stores all facts in factlists that are sorted by their name,
so it gets a database representation with a table for every
fact type found. |
| FactList |
FactList is the base implementation for a collection of relations.
|
| MatchingStatement |
Title: MatchingStatement
Descrpition: a statement able to query a factlist or another statement.
it is the most bottom class in the expression tree |
| NodeStatement |
Title: NodeStatement
Descrpition: A class abstract base class prepresenting a statement
with more than one child statements |
| Program |
Title: Programm
Descrpition: this class describes a prolog programm |
| ProgramBuilder |
IProgramBuilder is a kind of class factory.
|
| Query |
Query is a fact implementation with overriding
the toString method.
|
| QueryList |
A query list stores statementtrees having a Query as root
prolog:
? |
| Relation |
The base class of a relation between some atoms, like a row
in a database. |
| StatementMap |
The statementmap stores statements under their name.
|
| SymbolTable |
The symboltable is created by the scanner and parser during parsing.
|
| Value |
This class encapsulates a constant value, one item of a relation.
|
| Variable |
This class encapsulates a variable value used in queries.
|