|
Class Summary |
| build |
Abstract class build for the tree example. |
| expression |
Goal class for the expression rule. |
| Go |
Executes arithmetic expressions from standard input. |
| Input |
Lexical analyzer for tree.ebnf. |
| Node |
base class to store and evaluate arithmetic expressions. |
| Node.Add |
implements addition. |
| Node.Binary |
represents a binary operator. |
| Node.Div |
implements division. |
| Node.Minus |
implements sign change. |
| Node.Mul |
implements multiplication. |
| Node.Sub |
implements subtraction. |
| Node.Unary |
represents a unary operator. |
| product |
Goal class for the product rule. |
| product.div |
Inner class implements tree building for division |
| product.mul |
Inner class implements tree building for multiplication |
| sum |
Goal class for the sum rule. |
| term |
Goal class for the term rule. |
| term.minus |
Inner class implements unary minus |