XJavaDoc - 1.1

Clover coverage report - XJavaDoc - 1.1

Coverage timestamp: Mon Oct 4 2004 23:49:51 BST

FRAMES NO FRAMES

file stats:	LOC:	124		Methods:	12
	NCLOC:	81		Classes:	1

30 day Evaluation Version distributed via the Maven Jar Repository. Clover is not free. You have 30 days to evaluate it. Please visit http://www.thecortex.net/clover to obtain a licensed version of Clover

Source file

Conditionals

Statements

Methods

TOTAL

JJTNodeParserState.java

40%

60.5%

58.3%

56.9%

 /* Generated By:JJTree: Do not edit this line. /home/andy/development/xjavadoc-1.1/target/src/xjavadoc/JJTNodeParserState.java */
 
 package xjavadoc;
 
 class JJTNodeParserState {
   private java.util.Stack nodes;
   private java.util.Stack marks;
 
   private int sp;        // number of nodes on stack
   private int mk;        // current mark
   private boolean node_created;
 
   JJTNodeParserState() {
     nodes = new java.util.Stack();
     marks = new java.util.Stack();
     sp = 0;
     mk = 0;
   }
 
   /* Determines whether the current node was actually closed and
      pushed.  This should only be called in the final user action of a
      node scope.  */
   boolean nodeCreated() {
     return node_created;
   }
 
   /* Call this to reinitialize the node stack.  It is called
      automatically by the parser's ReInit() method. */
   void reset() {
     nodes.removeAllElements();
     marks.removeAllElements();
     sp = 0;
     mk = 0;
   }
 
   /* Returns the root node of the AST.  It only makes sense to call
      this after a successful parse. */
   Node rootNode() {
     return (Node)nodes.elementAt(0);
   }
 
   /* Pushes a node on to the stack. */
   void pushNode(Node n) {
     nodes.push(n);
     ++sp;
   }
 
   /* Returns the node on the top of the stack, and remove it from the
      stack.  */
   Node popNode() {
     if (--sp < mk) {
       mk = ((Integer)marks.pop()).intValue();
     }
     return (Node)nodes.pop();
   }
 
   /* Returns the node currently on the top of the stack. */
   Node peekNode() {
     return (Node)nodes.peek();
   }
 
   /* Returns the number of children on the stack in the current node
      scope. */
   int nodeArity() {
     return sp - mk;
   }
 
 
   void clearNodeScope(Node n) {
     while (sp > mk) {
       popNode();
     }
     mk = ((Integer)marks.pop()).intValue();
   }
 
 
   void openNodeScope(Node n) {
     marks.push(new Integer(mk));
     mk = sp;
     n.jjtOpen();
   }
 
 
   /* A definite node is constructed from a specified number of
      children.  That number of nodes are popped from the stack and
      made the children of the definite node.  Then the definite node
      is pushed on to the stack. */
   void closeNodeScope(Node n, int num) {
     mk = ((Integer)marks.pop()).intValue();
     while (num-- > 0) {
       Node c = popNode();
       c.jjtSetParent(n);
       n.jjtAddChild(c, num);
     }
     n.jjtClose();
     pushNode(n);
     node_created = true;
   }
 
 
   /* A conditional node is constructed if its condition is true.  All
      the nodes that have been pushed since the node was opened are
      made children of the the conditional node, which is then pushed
      on to the stack.  If the condition is false the node is not
      constructed and they are left on the stack. */
   void closeNodeScope(Node n, boolean condition) {
     if (condition) {
       int a = nodeArity();
       mk = ((Integer)marks.pop()).intValue();
       while (a-- > 0) {
     Node c = popNode();
     c.jjtSetParent(n);
     n.jjtAddChild(c, a);
       }
       n.jjtClose();
       pushNode(n);
       node_created = true;
     } else {
       mk = ((Integer)marks.pop()).intValue();
       node_created = false;
     }
   }
 }
 

1		/* Generated By:JJTree: Do not edit this line. /home/andy/development/xjavadoc-1.1/target/src/xjavadoc/JJTNodeParserState.java */
2
3		package xjavadoc;
4
5		class JJTNodeParserState {
6		private java.util.Stack nodes;
7		private java.util.Stack marks;
8
9		private int sp; // number of nodes on stack
10		private int mk; // current mark
11		private boolean node_created;
12
13	6	JJTNodeParserState() {
14	6	nodes = new java.util.Stack();
15	6	marks = new java.util.Stack();
16	6	sp = 0;
17	6	mk = 0;
18		}
19
20		/* Determines whether the current node was actually closed and
21		pushed. This should only be called in the final user action of a
22		node scope. */
23	0	boolean nodeCreated() {
24	0	return node_created;
25		}
26
27		/* Call this to reinitialize the node stack. It is called
28		automatically by the parser's ReInit() method. */
29	6	void reset() {
30	6	nodes.removeAllElements();
31	6	marks.removeAllElements();
32	6	sp = 0;
33	6	mk = 0;
34		}
35
36		/* Returns the root node of the AST. It only makes sense to call
37		this after a successful parse. */
38	0	Node rootNode() {
39	0	return (Node)nodes.elementAt(0);
40		}
41
42		/* Pushes a node on to the stack. */
43	2500	void pushNode(Node n) {
44	2500	nodes.push(n);
45	2500	++sp;
46		}
47
48		/* Returns the node on the top of the stack, and remove it from the
49		stack. */
50	2494	Node popNode() {
51	2494	if (--sp < mk) {
52	0	mk = ((Integer)marks.pop()).intValue();
53		}
54	2494	return (Node)nodes.pop();
55		}
56
57		/* Returns the node currently on the top of the stack. */
58	0	Node peekNode() {
59	0	return (Node)nodes.peek();
60		}
61
62		/* Returns the number of children on the stack in the current node
63		scope. */
64	2500	int nodeArity() {
65	2500	return sp - mk;
66		}
67
68
69	0	void clearNodeScope(Node n) {
70	0	while (sp > mk) {
71	0	popNode();
72		}
73	0	mk = ((Integer)marks.pop()).intValue();
74		}
75
76
77	2500	void openNodeScope(Node n) {
78	2500	marks.push(new Integer(mk));
79	2500	mk = sp;
80	2500	n.jjtOpen();
81		}
82
83
84		/* A definite node is constructed from a specified number of
85		children. That number of nodes are popped from the stack and
86		made the children of the definite node. Then the definite node
87		is pushed on to the stack. */
88	0	void closeNodeScope(Node n, int num) {
89	0	mk = ((Integer)marks.pop()).intValue();
90	0	while (num-- > 0) {
91	0	Node c = popNode();
92	0	c.jjtSetParent(n);
93	0	n.jjtAddChild(c, num);
94		}
95	0	n.jjtClose();
96	0	pushNode(n);
97	0	node_created = true;
98		}
99
100
101		/* A conditional node is constructed if its condition is true. All
102		the nodes that have been pushed since the node was opened are
103		made children of the the conditional node, which is then pushed
104		on to the stack. If the condition is false the node is not
105		constructed and they are left on the stack. */
106	2500	void closeNodeScope(Node n, boolean condition) {
107	2500	if (condition) {
108	2500	int a = nodeArity();
109	2500	mk = ((Integer)marks.pop()).intValue();
110	2500	while (a-- > 0) {
111	2494	Node c = popNode();
112	2494	c.jjtSetParent(n);
113	2494	n.jjtAddChild(c, a);
114		}
115	2500	n.jjtClose();
116	2500	pushNode(n);
117	2500	node_created = true;
118		} else {
119	0	mk = ((Integer)marks.pop()).intValue();
120	0	node_created = false;
121		}
122		}
123		}
124