AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
ExpressionTreeExample.java
Go to the documentation of this file.
1
package
aud.example.expr;
3
public
class
ExpressionTreeExample
{
4
5
public
static
void
main
(String[] args) {
6
ExpressionTree
tree=
new
ExpressionTree
7
(
new
Times
(),
8
new
ExpressionTree
9
(
new
Plus
(),
10
new
ExpressionTree
(
new
Number
(2)),
11
new
ExpressionTree
(
new
Number
(3))),
12
new
ExpressionTree
(
new
Number
(5))
13
);
// (2+3)*5
14
System.out.println(tree);
15
System.out.println(tree.
getValue
());
16
}
17
}
aud.example.expr.ExpressionTreeExample
ExpressionTree: minimal example.
Definition:
ExpressionTreeExample.java:3
aud.example.expr.ExpressionTreeExample.main
static void main(String[] args)
Definition:
ExpressionTreeExample.java:5
aud.example.expr.ExpressionTree
Tree representation of arithmetic expression.
Definition:
ExpressionTree.java:14
aud.example.expr.ExpressionTree.getValue
double getValue()
compute value of expression
Definition:
ExpressionTree.java:34
aud.example.expr.Number
Node representing constant number.
Definition:
Number.java:6
aud.example.expr.Plus
binary + operator: A+B
Definition:
Plus.java:4
aud.example.expr.Times
binary * operator: A*B
Definition:
Times.java:4
example
expr
ExpressionTreeExample.java
Generated on Tue Apr 15 2025 13:46:54 for AuD by
1.9.5