diff options
author | bd-912 <bdunahu@colostate.edu> | 2024-03-27 23:20:35 -0600 |
---|---|---|
committer | bd-912 <bdunahu@colostate.edu> | 2024-03-27 23:20:35 -0600 |
commit | 835e614e1e2531db3dc7dbe027de122a9fa0b78f (patch) | |
tree | c850ac64341cd8ceb56de23f71219c89b7bc3317 /syntaxtree/NodeSequence.java | |
parent | b01fe1e8e5541d6c11f905d7fbb949d747f29230 (diff) |
Reorder generated files
Diffstat (limited to 'syntaxtree/NodeSequence.java')
-rw-r--r-- | syntaxtree/NodeSequence.java | 45 |
1 files changed, 45 insertions, 0 deletions
diff --git a/syntaxtree/NodeSequence.java b/syntaxtree/NodeSequence.java new file mode 100644 index 0000000..88096a9 --- /dev/null +++ b/syntaxtree/NodeSequence.java @@ -0,0 +1,45 @@ +// +// Generated by JTB 1.3.2 +// + +package syntaxtree; + +import java.util.*; + +/** + * Represents a sequence of nodes nested within a choice, list, + * optional list, or optional, e.g. ( A B )+ or [ C D E ] + */ +public class NodeSequence implements NodeListInterface { + public NodeSequence(int n) { + nodes = new Vector<Node>(n); + } + + public NodeSequence(Node firstNode) { + nodes = new Vector<Node>(); + addNode(firstNode); + } + + public void addNode(Node n) { + nodes.addElement(n); + } + + public Node elementAt(int i) { return nodes.elementAt(i); } + public Enumeration<Node> elements() { return nodes.elements(); } + public int size() { return nodes.size(); } + public void accept(visitor.Visitor v) { + v.visit(this); + } + public <R,A> R accept(visitor.GJVisitor<R,A> v, A argu) { + return v.visit(this,argu); + } + public <R> R accept(visitor.GJNoArguVisitor<R> v) { + return v.visit(this); + } + public <A> void accept(visitor.GJVoidVisitor<A> v, A argu) { + v.visit(this,argu); + } + + public Vector<Node> nodes; +} + |