-
Notifications
You must be signed in to change notification settings - Fork 4
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
JSONParser grammar (and generated files)
update .gitignore javacc preferences
- Loading branch information
Showing
14 changed files
with
3,184 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,5 @@ | ||
.DS_Store | ||
*.class | ||
classes | ||
classes | ||
bin | ||
.settings/org.eclipse.jdt.core.prefs |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,11 @@ | ||
#Thu Jul 21 14:31:44 EDT 2011 | ||
CLEAR_CONSOLE=false | ||
JAVACC_OPTIONS= | ||
JJDOC_OPTIONS= | ||
JJTREE_OPTIONS= | ||
JJ_NATURE=false | ||
JTB_OPTIONS=-ia -jd -tk | ||
RUNTIME_JJJAR=${eclipse_home}/plugins/sf.eclipse.javacc_1.5.24/javacc.jar | ||
RUNTIME_JTBJAR=${eclipse_home}/plugins/sf.eclipse.javacc_1.5.24/jtb-1.4.4.jar | ||
SUPPRESS_WARNINGS=true | ||
eclipse.preferences.version=1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,123 @@ | ||
/* Generated By:JavaCC: Do not edit this line. JJTJSONParserState.java Version 5.0 */ | ||
package org.mwnorman.json; | ||
|
||
public class JJTJSONParserState { | ||
private java.util.List<Node> nodes; | ||
private java.util.List<Integer> marks; | ||
|
||
private int sp; // number of nodes on stack | ||
private int mk; // current mark | ||
private boolean node_created; | ||
|
||
public JJTJSONParserState() { | ||
nodes = new java.util.ArrayList<Node>(); | ||
marks = new java.util.ArrayList<Integer>(); | ||
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. */ | ||
public boolean nodeCreated() { | ||
return node_created; | ||
} | ||
|
||
/* Call this to reinitialize the node stack. It is called | ||
automatically by the parser's ReInit() method. */ | ||
public void reset() { | ||
nodes.clear(); | ||
marks.clear(); | ||
sp = 0; | ||
mk = 0; | ||
} | ||
|
||
/* Returns the root node of the AST. It only makes sense to call | ||
this after a successful parse. */ | ||
public Node rootNode() { | ||
return nodes.get(0); | ||
} | ||
|
||
/* Pushes a node on to the stack. */ | ||
public void pushNode(Node n) { | ||
nodes.add(n); | ||
++sp; | ||
} | ||
|
||
/* Returns the node on the top of the stack, and remove it from the | ||
stack. */ | ||
public Node popNode() { | ||
if (--sp < mk) { | ||
mk = marks.remove(marks.size()-1); | ||
} | ||
return nodes.remove(nodes.size()-1); | ||
} | ||
|
||
/* Returns the node currently on the top of the stack. */ | ||
public Node peekNode() { | ||
return nodes.get(nodes.size()-1); | ||
} | ||
|
||
/* Returns the number of children on the stack in the current node | ||
scope. */ | ||
public int nodeArity() { | ||
return sp - mk; | ||
} | ||
|
||
|
||
public void clearNodeScope(Node n) { | ||
while (sp > mk) { | ||
popNode(); | ||
} | ||
mk = marks.remove(marks.size()-1); | ||
} | ||
|
||
|
||
public void openNodeScope(Node n) { | ||
marks.add(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. */ | ||
public void closeNodeScope(Node n, int num) { | ||
mk = marks.remove(marks.size()-1); | ||
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 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. */ | ||
public void closeNodeScope(Node n, boolean condition) { | ||
if (condition) { | ||
int a = nodeArity(); | ||
mk = marks.remove(marks.size()-1); | ||
while (a-- > 0) { | ||
Node c = popNode(); | ||
c.jjtSetParent(n); | ||
n.jjtAddChild(c, a); | ||
} | ||
n.jjtClose(); | ||
pushNode(n); | ||
node_created = true; | ||
} else { | ||
mk = marks.remove(marks.size()-1); | ||
node_created = false; | ||
} | ||
} | ||
} | ||
/* JavaCC - OriginalChecksum=8c4930387b9074400b833293ef832656 (do not edit this line) */ |
Oops, something went wrong.