From 7854a38ed79ac2bee2050dbc427ef3e96784776f Mon Sep 17 00:00:00 2001 From: Mike Norman Date: Tue, 16 Aug 2011 12:08:36 -0400 Subject: [PATCH] JSONParser grammar (and generated files) update .gitignore javacc preferences --- .gitignore | 4 +- .settings/sf.eclipse.javacc.prefs | 11 + src/org/mwnorman/json/JJTJSONParserState.java | 123 +++ src/org/mwnorman/json/JSONParser.java | 306 ++++++ src/org/mwnorman/json/JSONParser.jj | 247 +++++ src/org/mwnorman/json/JSONParser.jjt | 243 +++++ .../mwnorman/json/JSONParserConstants.java | 120 +++ .../mwnorman/json/JSONParserTokenManager.java | 915 ++++++++++++++++++ .../json/JSONParserTreeConstants.java | 13 + src/org/mwnorman/json/JavaCharStream.java | 638 ++++++++++++ src/org/mwnorman/json/Node.java | 37 + src/org/mwnorman/json/ParseException.java | 208 ++++ src/org/mwnorman/json/Token.java | 152 +++ src/org/mwnorman/json/TokenMgrError.java | 168 ++++ 14 files changed, 3184 insertions(+), 1 deletion(-) create mode 100644 .settings/sf.eclipse.javacc.prefs create mode 100644 src/org/mwnorman/json/JJTJSONParserState.java create mode 100644 src/org/mwnorman/json/JSONParser.java create mode 100644 src/org/mwnorman/json/JSONParser.jj create mode 100644 src/org/mwnorman/json/JSONParser.jjt create mode 100644 src/org/mwnorman/json/JSONParserConstants.java create mode 100644 src/org/mwnorman/json/JSONParserTokenManager.java create mode 100644 src/org/mwnorman/json/JSONParserTreeConstants.java create mode 100644 src/org/mwnorman/json/JavaCharStream.java create mode 100644 src/org/mwnorman/json/Node.java create mode 100644 src/org/mwnorman/json/ParseException.java create mode 100644 src/org/mwnorman/json/Token.java create mode 100644 src/org/mwnorman/json/TokenMgrError.java diff --git a/.gitignore b/.gitignore index fb5f9a0..773a2fe 100644 --- a/.gitignore +++ b/.gitignore @@ -1,3 +1,5 @@ .DS_Store *.class -classes \ No newline at end of file +classes +bin +.settings/org.eclipse.jdt.core.prefs \ No newline at end of file diff --git a/.settings/sf.eclipse.javacc.prefs b/.settings/sf.eclipse.javacc.prefs new file mode 100644 index 0000000..7de22ea --- /dev/null +++ b/.settings/sf.eclipse.javacc.prefs @@ -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 diff --git a/src/org/mwnorman/json/JJTJSONParserState.java b/src/org/mwnorman/json/JJTJSONParserState.java new file mode 100644 index 0000000..0a4c65e --- /dev/null +++ b/src/org/mwnorman/json/JJTJSONParserState.java @@ -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 nodes; + private java.util.List 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(); + marks = new java.util.ArrayList(); + 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) */ diff --git a/src/org/mwnorman/json/JSONParser.java b/src/org/mwnorman/json/JSONParser.java new file mode 100644 index 0000000..b28b4c8 --- /dev/null +++ b/src/org/mwnorman/json/JSONParser.java @@ -0,0 +1,306 @@ +/* Generated By:JJTree&JavaCC: Do not edit this line. JSONParser.java */ +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; + +//javase imports +import java.util.ArrayList; +import java.util.Collections; +import java.util.LinkedHashMap; +import java.util.List; +import java.util.Map; + +public class JSONParser/*@bgen(jjtree)*/implements JSONParserTreeConstants, JSONParserConstants {/*@bgen(jjtree)*/ + protected JJTJSONParserState jjtree = new JJTJSONParserState(); + public JSONParser() { + super(); + } + + final public Object parse() throws ParseException { +Object o = null; + switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { + case O_OPENBRACE: + o = object(); + break; + case O_OPENBRACKET: + o = array(); + break; + default: + jj_consume_token(-1); + throw new ParseException(); + } + {if (true) return o;} + throw new Error("Missing return statement in function"); + } + + final public Object object() throws ParseException { +Map m = new LinkedHashMap(); + jj_consume_token(O_OPENBRACE); + switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { + case STRING: + members(m); + break; + default: + ; + } + jj_consume_token(O_CLOSEBRACE); + {if (true) return m;} + throw new Error("Missing return statement in function"); + } + + final public void members(Map m) throws ParseException { + pair(m); + switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { + case O_COMMA: + jj_consume_token(O_COMMA); + members(m); + break; + default: + ; + } + } + + final public void pair(Map m) throws ParseException { +Token t = null; +Object o; + t = jj_consume_token(STRING); + jj_consume_token(O_COLON); + o = value(); + m.put(t.image, o); + } + + final public Object array() throws ParseException { +List a=new ArrayList(); + jj_consume_token(O_OPENBRACKET); + switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { + case K_TRUE: + case K_FALSE: + case K_NULL: + case O_OPENBRACE: + case O_OPENBRACKET: + case NUMBER: + case STRING: + elements(a); + break; + default: + ; + } + jj_consume_token(O_CLOSEBRACKET); + Collections.reverse(a); + {if (true) return a;} + throw new Error("Missing return statement in function"); + } + + final public void elements(List a) throws ParseException { +Object o = null; + o = value(); + switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { + case O_COMMA: + jj_consume_token(O_COMMA); + elements(a); + break; + default: + ; + } + a.add(o); + } + + final public Object value() throws ParseException { +Token t = null; +Object o = null; + switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { + case O_OPENBRACE: + o = object(); + break; + case O_OPENBRACKET: + o = array(); + break; + case STRING: + t = jj_consume_token(STRING); + o = t.image; + break; + case NUMBER: + t = jj_consume_token(NUMBER); + try { + o = Integer.valueOf(t.image); + + } + catch (NumberFormatException nfe1) { + try { + o = Long.valueOf(t.image); + } + catch (NumberFormatException nfe2) { + try { + o = Float.valueOf(t.image); + } + catch (NumberFormatException nfe3) { + try { + o = Double.valueOf(t.image); + } + catch (NumberFormatException nfe4) { + o = Double.NaN; + } + } + } + + } + break; + case K_TRUE: + jj_consume_token(K_TRUE); + o = Boolean.TRUE; + break; + case K_FALSE: + jj_consume_token(K_FALSE); + o = Boolean.TRUE; + break; + case K_NULL: + jj_consume_token(K_NULL); + break; + default: + jj_consume_token(-1); + throw new ParseException(); + } + {if (true) return o;} + throw new Error("Missing return statement in function"); + } + + /** Generated Token Manager. */ + public JSONParserTokenManager token_source; + JavaCharStream jj_input_stream; + /** Current token. */ + public Token token; + /** Next token. */ + public Token jj_nt; + private int jj_ntk; + + /** Constructor with InputStream. */ + public JSONParser(java.io.InputStream stream) { + this(stream, null); + } + /** Constructor with InputStream and supplied encoding */ + public JSONParser(java.io.InputStream stream, String encoding) { + try { jj_input_stream = new JavaCharStream(stream, encoding, 1, 1); } catch(java.io.UnsupportedEncodingException e) { throw new RuntimeException(e); } + token_source = new JSONParserTokenManager(jj_input_stream); + token = new Token(); + jj_ntk = -1; + } + + /** Reinitialise. */ + public void ReInit(java.io.InputStream stream) { + ReInit(stream, null); + } + /** Reinitialise. */ + public void ReInit(java.io.InputStream stream, String encoding) { + try { jj_input_stream.ReInit(stream, encoding, 1, 1); } catch(java.io.UnsupportedEncodingException e) { throw new RuntimeException(e); } + token_source.ReInit(jj_input_stream); + token = new Token(); + jj_ntk = -1; + jjtree.reset(); + } + + /** Constructor. */ + public JSONParser(java.io.Reader stream) { + jj_input_stream = new JavaCharStream(stream, 1, 1); + token_source = new JSONParserTokenManager(jj_input_stream); + token = new Token(); + jj_ntk = -1; + } + + /** Reinitialise. */ + public void ReInit(java.io.Reader stream) { + jj_input_stream.ReInit(stream, 1, 1); + token_source.ReInit(jj_input_stream); + token = new Token(); + jj_ntk = -1; + jjtree.reset(); + } + + /** Constructor with generated Token Manager. */ + public JSONParser(JSONParserTokenManager tm) { + token_source = tm; + token = new Token(); + jj_ntk = -1; + } + + /** Reinitialise. */ + public void ReInit(JSONParserTokenManager tm) { + token_source = tm; + token = new Token(); + jj_ntk = -1; + jjtree.reset(); + } + + private Token jj_consume_token(int kind) throws ParseException { + Token oldToken; + if ((oldToken = token).next != null) token = token.next; + else token = token.next = token_source.getNextToken(); + jj_ntk = -1; + if (token.kind == kind) { + return token; + } + token = oldToken; + throw generateParseException(); + } + + +/** Get the next Token. */ + final public Token getNextToken() { + if (token.next != null) token = token.next; + else token = token.next = token_source.getNextToken(); + jj_ntk = -1; + return token; + } + +/** Get the specific Token. */ + final public Token getToken(int index) { + Token t = token; + for (int i = 0; i < index; i++) { + if (t.next != null) t = t.next; + else t = t.next = token_source.getNextToken(); + } + return t; + } + + private int jj_ntk() { + if ((jj_nt=token.next) == null) + return (jj_ntk = (token.next=token_source.getNextToken()).kind); + else + return (jj_ntk = jj_nt.kind); + } + + /** Generate ParseException. */ + public ParseException generateParseException() { + Token errortok = token.next; + int line = errortok.beginLine, column = errortok.beginColumn; + String mess = (errortok.kind == 0) ? tokenImage[0] : errortok.image; + return new ParseException("Parse error at line " + line + ", column " + column + ". Encountered: " + mess); + } + + /** Enable tracing. */ + final public void enable_tracing() { + } + + /** Disable tracing. */ + final public void disable_tracing() { + } + +} diff --git a/src/org/mwnorman/json/JSONParser.jj b/src/org/mwnorman/json/JSONParser.jj new file mode 100644 index 0000000..c924489 --- /dev/null +++ b/src/org/mwnorman/json/JSONParser.jj @@ -0,0 +1,247 @@ +/*@bgen(jjtree) Generated By:JJTree: Do not edit this line. JSONParser.jj */ +/*@egen*//* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +options { + STATIC = false; + SUPPORT_CLASS_VISIBILITY_PUBLIC = true; + ERROR_REPORTING = false; + JAVA_UNICODE_ESCAPE = true; + UNICODE_INPUT = true; + + +} + +PARSER_BEGIN(JSONParser) +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; + +//javase imports +import java.util.ArrayList; +import java.util.Collections; +import java.util.LinkedHashMap; +import java.util.List; +import java.util.Map; + +public class JSONParser/*@bgen(jjtree)*/implements JSONParserTreeConstants/*@egen*/ {/*@bgen(jjtree)*/ + protected JJTJSONParserState jjtree = new JJTJSONParserState(); + +/*@egen*/ + + public JSONParser() { + super(); + } +} + +PARSER_END(JSONParser) + +// Pls see http://www.ietf.org/rfc/rfc4627.txt for JSON spec details + +// white space +SKIP: { + " " + | "\t" + | "\n" + | "\r" + | "\f" +} +// comments: not really part of JSON spec, but parser shouldn't blow-up if present +SKIP: { + +} +SKIP: { + +} + +// JSON reserved keywords (prefix with K_ to avoid naming conflicts): only lower case allowed! +TOKEN: { + + | + | +} + +// JSON operators (prefix with O_ to avoid naming conflicts) +TOKEN: { + + | + | + | + | + | + | + | + | +} + +// numeric literals +TOKEN: { + <#DIGIT: ["0" - "9"] > + | <#NONZERO_DIGIT: ["1" - "9"] > + | <#EXP: ["e", "E"] ( | )? > +} +// JSON numbers do not support octal or hexadecimal formats +TOKEN: { + + | | | > + | )? ( | ) > + | > + | > + | )+ > +} + +// string literals +TOKEN: { + )* "\"" > + | +} + +Object parse() : +{ +Object o = null; +} +{ + ( o=object() | o=array() ) + { + return o; + } +} + +Object object() : +{ +Map m = new LinkedHashMap(); +} +{ + ( members(m) )? + { + return m; + } +} + +void members(Map m) : +{ +} +{ + pair(m) [ members(m) ] +} + +void pair(Map m) : +{ +Token t = null; +Object o; +} +{ + t= o=value() + { + m.put(t.image, o); + } +} + +Object array() : +{ +List a=new ArrayList(); +} +{ + ( elements(a) )? + { + Collections.reverse(a); + return a; + } +} + +void elements(List a) : +{ +Object o = null; +} +{ + o=value() [ elements(a) ] + { + a.add(o); + } +} + +Object value() : +{ +Token t = null; +Object o = null; +} +{ + ( o=object() + | o=array() + | t= {o = t.image;} + | t= + { + try { + o = Integer.valueOf(t.image); + } + catch (NumberFormatException nfe1) { + try { + o = Long.valueOf(t.image); + } + catch (NumberFormatException nfe2) { + try { + o = Float.valueOf(t.image); + } + catch (NumberFormatException nfe3) { + try { + o = Double.valueOf(t.image); + } + catch (NumberFormatException nfe4) { + o = Double.NaN; + } + } + } + } + } + | {o = Boolean.TRUE;} + | {o = Boolean.TRUE;} + | ) + { + return o; + } +} \ No newline at end of file diff --git a/src/org/mwnorman/json/JSONParser.jjt b/src/org/mwnorman/json/JSONParser.jjt new file mode 100644 index 0000000..23e3f16 --- /dev/null +++ b/src/org/mwnorman/json/JSONParser.jjt @@ -0,0 +1,243 @@ +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +options { + STATIC = false; + SUPPORT_CLASS_VISIBILITY_PUBLIC = true; + ERROR_REPORTING = false; + JAVA_UNICODE_ESCAPE = true; + UNICODE_INPUT = true; + NODE_USES_PARSER = false; + VISITOR = false; +} + +PARSER_BEGIN(JSONParser) +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; + +//javase imports +import java.util.ArrayList; +import java.util.Collections; +import java.util.LinkedHashMap; +import java.util.List; +import java.util.Map; + +public class JSONParser { + + public JSONParser() { + super(); + } +} + +PARSER_END(JSONParser) + +// Pls see http://www.ietf.org/rfc/rfc4627.txt for JSON spec details + +// white space +SKIP: { + " " + | "\t" + | "\n" + | "\r" + | "\f" +} +// comments: not really part of JSON spec, but parser shouldn't blow-up if present +SKIP: { + +} +SKIP: { + +} + +// JSON reserved keywords (prefix with K_ to avoid naming conflicts): only lower case allowed! +TOKEN: { + + | + | +} + +// JSON operators (prefix with O_ to avoid naming conflicts) +TOKEN: { + + | + | + | + | + | + | + | + | +} + +// numeric literals +TOKEN: { + <#DIGIT: ["0" - "9"] > + | <#NONZERO_DIGIT: ["1" - "9"] > + | <#EXP: ["e", "E"] ( | )? > +} +// JSON numbers do not support octal or hexadecimal formats +TOKEN: { + + | | | > + | )? ( | ) > + | > + | > + | )+ > +} + +// string literals +TOKEN: { + )* "\"" > + | +} + +Object parse() #void: +{ +Object o = null; +} +{ + ( o=object() | o=array() ) + { + return o; + } +} + +Object object() #void: +{ +Map m = new LinkedHashMap(); +} +{ + ( members(m) )? + { + return m; + } +} + +void members(Map m) #void: +{ +} +{ + pair(m) [ members(m) ] +} + +void pair(Map m) #void: +{ +Token t = null; +Object o; +} +{ + t= o=value() + { + m.put(t.image, o); + } +} + +Object array() #void: +{ +List a=new ArrayList(); +} +{ + ( elements(a) )? + { + Collections.reverse(a); + return a; + } +} + +void elements(List a) #void: +{ +Object o = null; +} +{ + o=value() [ elements(a) ] + { + a.add(o); + } +} + +Object value() #void: +{ +Token t = null; +Object o = null; +} +{ + ( o=object() + | o=array() + | t= {o = t.image;} + | t= + { + try { + o = Integer.valueOf(t.image); + } + catch (NumberFormatException nfe1) { + try { + o = Long.valueOf(t.image); + } + catch (NumberFormatException nfe2) { + try { + o = Float.valueOf(t.image); + } + catch (NumberFormatException nfe3) { + try { + o = Double.valueOf(t.image); + } + catch (NumberFormatException nfe4) { + o = Double.NaN; + } + } + } + } + } + | {o = Boolean.TRUE;} + | {o = Boolean.TRUE;} + | ) + { + return o; + } +} \ No newline at end of file diff --git a/src/org/mwnorman/json/JSONParserConstants.java b/src/org/mwnorman/json/JSONParserConstants.java new file mode 100644 index 0000000..af570c2 --- /dev/null +++ b/src/org/mwnorman/json/JSONParserConstants.java @@ -0,0 +1,120 @@ +/* Generated By:JJTree&JavaCC: Do not edit this line. JSONParserConstants.java */ +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; + + +/** + * Token literal values and constants. + * Generated by org.javacc.parser.OtherFilesGen#start() + */ +public interface JSONParserConstants { + + /** End of File. */ + int EOF = 0; + /** RegularExpression Id. */ + int COMMENT_LINE = 6; + /** RegularExpression Id. */ + int COMMENT_BLOCK = 7; + /** RegularExpression Id. */ + int K_TRUE = 8; + /** RegularExpression Id. */ + int K_FALSE = 9; + /** RegularExpression Id. */ + int K_NULL = 10; + /** RegularExpression Id. */ + int O_OPENBRACE = 11; + /** RegularExpression Id. */ + int O_CLOSEBRACE = 12; + /** RegularExpression Id. */ + int O_OPENBRACKET = 13; + /** RegularExpression Id. */ + int O_CLOSEBRACKET = 14; + /** RegularExpression Id. */ + int O_COMMA = 15; + /** RegularExpression Id. */ + int O_COLON = 16; + /** RegularExpression Id. */ + int O_DOT = 17; + /** RegularExpression Id. */ + int O_PLUS = 18; + /** RegularExpression Id. */ + int O_MINUS = 19; + /** RegularExpression Id. */ + int DIGIT = 20; + /** RegularExpression Id. */ + int NONZERO_DIGIT = 21; + /** RegularExpression Id. */ + int EXP = 22; + /** RegularExpression Id. */ + int NUMBER = 23; + /** RegularExpression Id. */ + int INTEGER = 24; + /** RegularExpression Id. */ + int FRACTIONAL_DIGITS = 25; + /** RegularExpression Id. */ + int EXPONENT = 26; + /** RegularExpression Id. */ + int DIGITS = 27; + /** RegularExpression Id. */ + int STRING = 28; + /** RegularExpression Id. */ + int ALLOWABLE_CHARACTERS = 29; + + /** Lexical state. */ + int DEFAULT = 0; + + /** Literal token values. */ + String[] tokenImage = { + "", + "\" \"", + "\"\\t\"", + "\"\\n\"", + "\"\\r\"", + "\"\\f\"", + "", + "", + "\"true\"", + "\"false\"", + "\"null\"", + "\"{\"", + "\"}\"", + "\"[\"", + "\"]\"", + "\",\"", + "\":\"", + "\".\"", + "\"+\"", + "\"-\"", + "", + "", + "", + "", + "", + "", + "", + "", + "", + "", + }; + +} diff --git a/src/org/mwnorman/json/JSONParserTokenManager.java b/src/org/mwnorman/json/JSONParserTokenManager.java new file mode 100644 index 0000000..b15e96c --- /dev/null +++ b/src/org/mwnorman/json/JSONParserTokenManager.java @@ -0,0 +1,915 @@ +/* Generated By:JJTree&JavaCC: Do not edit this line. JSONParserTokenManager.java */ +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; +//javase imports +import java.util.ArrayList; +import java.util.Collections; +import java.util.LinkedHashMap; +import java.util.List; +import java.util.Map; + +/** Token Manager. */ +public class JSONParserTokenManager implements JSONParserConstants +{ + + /** Debug output. */ + public java.io.PrintStream debugStream = System.out; + /** Set debug output. */ + public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; } +private final int jjStopStringLiteralDfa_0(int pos, long active0) +{ + switch (pos) + { + case 0: + if ((active0 & 0x20000L) != 0L) + return 1; + if ((active0 & 0x80000L) != 0L) + return 36; + if ((active0 & 0x700L) != 0L) + { + jjmatchedKind = 29; + return -1; + } + return -1; + case 1: + if ((active0 & 0x700L) != 0L) + { + if (jjmatchedPos == 0) + { + jjmatchedKind = 29; + jjmatchedPos = 0; + } + return -1; + } + return -1; + case 2: + if ((active0 & 0x700L) != 0L) + { + if (jjmatchedPos == 0) + { + jjmatchedKind = 29; + jjmatchedPos = 0; + } + return -1; + } + return -1; + case 3: + if ((active0 & 0x700L) != 0L) + { + if (jjmatchedPos == 0) + { + jjmatchedKind = 29; + jjmatchedPos = 0; + } + return -1; + } + return -1; + default : + return -1; + } +} +private final int jjStartNfa_0(int pos, long active0) +{ + return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1); +} +private int jjStopAtPos(int pos, int kind) +{ + jjmatchedKind = kind; + jjmatchedPos = pos; + return pos + 1; +} +private int jjMoveStringLiteralDfa0_0() +{ + switch(curChar) + { + case 32: + return jjStopAtPos(0, 1); + case 43: + return jjStopAtPos(0, 18); + case 44: + return jjStopAtPos(0, 15); + case 45: + return jjStartNfaWithStates_0(0, 19, 36); + case 46: + return jjStartNfaWithStates_0(0, 17, 1); + case 58: + return jjStopAtPos(0, 16); + case 91: + return jjStopAtPos(0, 13); + case 93: + return jjStopAtPos(0, 14); + case 102: + return jjMoveStringLiteralDfa1_0(0x200L); + case 110: + return jjMoveStringLiteralDfa1_0(0x400L); + case 116: + return jjMoveStringLiteralDfa1_0(0x100L); + case 123: + return jjStopAtPos(0, 11); + case 125: + return jjStopAtPos(0, 12); + default : + return jjMoveNfa_0(0, 0); + } +} +private int jjMoveStringLiteralDfa1_0(long active0) +{ + try { curChar = input_stream.readChar(); } + catch(java.io.IOException e) { + jjStopStringLiteralDfa_0(0, active0); + return 1; + } + switch(curChar) + { + case 97: + return jjMoveStringLiteralDfa2_0(active0, 0x200L); + case 114: + return jjMoveStringLiteralDfa2_0(active0, 0x100L); + case 117: + return jjMoveStringLiteralDfa2_0(active0, 0x400L); + default : + break; + } + return jjStartNfa_0(0, active0); +} +private int jjMoveStringLiteralDfa2_0(long old0, long active0) +{ + if (((active0 &= old0)) == 0L) + return jjStartNfa_0(0, old0); + try { curChar = input_stream.readChar(); } + catch(java.io.IOException e) { + jjStopStringLiteralDfa_0(1, active0); + return 2; + } + switch(curChar) + { + case 108: + return jjMoveStringLiteralDfa3_0(active0, 0x600L); + case 117: + return jjMoveStringLiteralDfa3_0(active0, 0x100L); + default : + break; + } + return jjStartNfa_0(1, active0); +} +private int jjMoveStringLiteralDfa3_0(long old0, long active0) +{ + if (((active0 &= old0)) == 0L) + return jjStartNfa_0(1, old0); + try { curChar = input_stream.readChar(); } + catch(java.io.IOException e) { + jjStopStringLiteralDfa_0(2, active0); + return 3; + } + switch(curChar) + { + case 101: + if ((active0 & 0x100L) != 0L) + return jjStopAtPos(3, 8); + break; + case 108: + if ((active0 & 0x400L) != 0L) + return jjStopAtPos(3, 10); + break; + case 115: + return jjMoveStringLiteralDfa4_0(active0, 0x200L); + default : + break; + } + return jjStartNfa_0(2, active0); +} +private int jjMoveStringLiteralDfa4_0(long old0, long active0) +{ + if (((active0 &= old0)) == 0L) + return jjStartNfa_0(2, old0); + try { curChar = input_stream.readChar(); } + catch(java.io.IOException e) { + jjStopStringLiteralDfa_0(3, active0); + return 4; + } + switch(curChar) + { + case 101: + if ((active0 & 0x200L) != 0L) + return jjStopAtPos(4, 9); + break; + default : + break; + } + return jjStartNfa_0(3, active0); +} +private int jjStartNfaWithStates_0(int pos, int kind, int state) +{ + jjmatchedKind = kind; + jjmatchedPos = pos; + try { curChar = input_stream.readChar(); } + catch(java.io.IOException e) { return pos + 1; } + return jjMoveNfa_0(state, pos + 1); +} +static final long[] jjbitVec0 = { + 0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL +}; +static final long[] jjbitVec2 = { + 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL +}; +private int jjMoveNfa_0(int startState, int curPos) +{ + int startsAt = 0; + jjnewStateCnt = 64; + int i = 1; + jjstateSet[0] = startState; + int kind = 0x7fffffff; + for (;;) + { + if (++jjround == 0x7fffffff) + ReInitRounds(); + if (curChar < 64) + { + long l = 1L << curChar; + do + { + switch(jjstateSet[--i]) + { + case 0: + if ((0xfffffffb00000000L & l) != 0L) + { + if (kind > 29) + kind = 29; + } + else if (curChar == 34) + jjCheckNAddStates(0, 2); + if ((0x3ff000000000000L & l) != 0L) + { + if (kind > 23) + kind = 23; + jjCheckNAddStates(3, 6); + } + else if (curChar == 45) + jjAddStates(7, 16); + else if (curChar == 47) + jjAddStates(17, 18); + else if (curChar == 46) + jjCheckNAdd(1); + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAddStates(19, 23); + break; + case 36: + if ((0x3ff000000000000L & l) != 0L) + { + if (kind > 24) + kind = 24; + } + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAdd(51); + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAdd(45); + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAdd(40); + if ((0x3ff000000000000L & l) != 0L) + { + if (kind > 23) + kind = 23; + } + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(60); + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(57); + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(49); + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(43); + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(38); + break; + case 1: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 25) + kind = 25; + jjCheckNAdd(1); + break; + case 3: + if ((0x280000000000L & l) != 0L) + jjCheckNAdd(4); + break; + case 4: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 26) + kind = 26; + jjCheckNAdd(4); + break; + case 5: + case 14: + if (curChar == 34) + jjCheckNAddStates(0, 2); + break; + case 6: + if ((0xfffffffb00000000L & l) != 0L) + jjCheckNAddStates(0, 2); + break; + case 9: + if ((0x3ff000000000000L & l) != 0L) + jjstateSet[jjnewStateCnt++] = 10; + break; + case 10: + if ((0x3ff000000000000L & l) != 0L) + jjstateSet[jjnewStateCnt++] = 11; + break; + case 11: + if ((0x3ff000000000000L & l) != 0L) + jjstateSet[jjnewStateCnt++] = 12; + break; + case 12: + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAddStates(0, 2); + break; + case 13: + if (curChar == 34 && kind > 28) + kind = 28; + break; + case 15: + if ((0xfffffffb00000000L & l) != 0L && kind > 29) + kind = 29; + break; + case 18: + if ((0x3ff000000000000L & l) != 0L) + jjstateSet[jjnewStateCnt++] = 19; + break; + case 19: + if ((0x3ff000000000000L & l) != 0L) + jjstateSet[jjnewStateCnt++] = 20; + break; + case 20: + if ((0x3ff000000000000L & l) != 0L) + jjstateSet[jjnewStateCnt++] = 21; + break; + case 21: + if ((0x3ff000000000000L & l) != 0L && kind > 29) + kind = 29; + break; + case 22: + if (curChar == 34 && kind > 29) + kind = 29; + break; + case 23: + if (curChar == 47) + jjAddStates(17, 18); + break; + case 24: + if (curChar == 47) + jjCheckNAddStates(24, 26); + break; + case 25: + if ((0xffffffffffffdbffL & l) != 0L) + jjCheckNAddStates(24, 26); + break; + case 26: + if ((0x2400L & l) != 0L && kind > 6) + kind = 6; + break; + case 27: + if (curChar == 10 && kind > 6) + kind = 6; + break; + case 28: + if (curChar == 13) + jjstateSet[jjnewStateCnt++] = 27; + break; + case 29: + if (curChar == 42) + jjCheckNAddTwoStates(30, 31); + break; + case 30: + if ((0xfffffbffffffffffL & l) != 0L) + jjCheckNAddTwoStates(30, 31); + break; + case 31: + if (curChar == 42) + jjCheckNAddStates(27, 29); + break; + case 32: + if ((0xffff7bffffffffffL & l) != 0L) + jjCheckNAddTwoStates(33, 31); + break; + case 33: + if ((0xfffffbffffffffffL & l) != 0L) + jjCheckNAddTwoStates(33, 31); + break; + case 34: + if (curChar == 47 && kind > 7) + kind = 7; + break; + case 35: + if (curChar == 45) + jjAddStates(7, 16); + break; + case 37: + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(38); + break; + case 38: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 23) + kind = 23; + jjCheckNAdd(38); + break; + case 39: + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAdd(40); + break; + case 40: + if (curChar == 46) + jjCheckNAdd(41); + break; + case 41: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 23) + kind = 23; + jjCheckNAdd(41); + break; + case 42: + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(43); + break; + case 43: + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAddTwoStates(43, 40); + break; + case 44: + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAdd(45); + break; + case 46: + if ((0x280000000000L & l) != 0L) + jjCheckNAdd(47); + break; + case 47: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 23) + kind = 23; + jjCheckNAdd(47); + break; + case 48: + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(49); + break; + case 49: + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAddTwoStates(49, 45); + break; + case 50: + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAdd(51); + break; + case 51: + if (curChar == 46) + jjCheckNAdd(52); + break; + case 52: + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAddTwoStates(52, 53); + break; + case 54: + if ((0x280000000000L & l) != 0L) + jjCheckNAdd(55); + break; + case 55: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 23) + kind = 23; + jjCheckNAdd(55); + break; + case 56: + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(57); + break; + case 57: + if ((0x3ff000000000000L & l) != 0L) + jjCheckNAddTwoStates(57, 51); + break; + case 58: + if ((0x3ff000000000000L & l) != 0L && kind > 24) + kind = 24; + break; + case 59: + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAdd(60); + break; + case 60: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 24) + kind = 24; + jjCheckNAdd(60); + break; + case 61: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 23) + kind = 23; + jjCheckNAddStates(3, 6); + break; + case 62: + if ((0x3ff000000000000L & l) == 0L) + break; + if (kind > 27) + kind = 27; + jjCheckNAdd(62); + break; + case 63: + if ((0x3fe000000000000L & l) != 0L) + jjCheckNAddStates(19, 23); + break; + default : break; + } + } while(i != startsAt); + } + else if (curChar < 128) + { + long l = 1L << (curChar & 077); + do + { + switch(jjstateSet[--i]) + { + case 0: + if ((0xffffffffefffffffL & l) != 0L) + { + if (kind > 29) + kind = 29; + } + else if (curChar == 92) + jjAddStates(30, 31); + if ((0x2000000020L & l) != 0L) + jjAddStates(32, 33); + break; + case 2: + if ((0x2000000020L & l) != 0L) + jjAddStates(32, 33); + break; + case 6: + if ((0xffffffffefffffffL & l) != 0L) + jjCheckNAddStates(0, 2); + break; + case 7: + if (curChar == 92) + jjAddStates(34, 35); + break; + case 8: + if (curChar == 117) + jjstateSet[jjnewStateCnt++] = 9; + break; + case 9: + if ((0x7e0000007eL & l) != 0L) + jjstateSet[jjnewStateCnt++] = 10; + break; + case 10: + if ((0x7e0000007eL & l) != 0L) + jjstateSet[jjnewStateCnt++] = 11; + break; + case 11: + if ((0x7e0000007eL & l) != 0L) + jjstateSet[jjnewStateCnt++] = 12; + break; + case 12: + if ((0x7e0000007eL & l) != 0L) + jjCheckNAddStates(0, 2); + break; + case 14: + if ((0x14404410000000L & l) != 0L) + jjCheckNAddStates(0, 2); + break; + case 15: + if ((0xffffffffefffffffL & l) != 0L && kind > 29) + kind = 29; + break; + case 16: + if (curChar == 92) + jjAddStates(30, 31); + break; + case 17: + if (curChar == 117) + jjstateSet[jjnewStateCnt++] = 18; + break; + case 18: + if ((0x7e0000007eL & l) != 0L) + jjstateSet[jjnewStateCnt++] = 19; + break; + case 19: + if ((0x7e0000007eL & l) != 0L) + jjstateSet[jjnewStateCnt++] = 20; + break; + case 20: + if ((0x7e0000007eL & l) != 0L) + jjstateSet[jjnewStateCnt++] = 21; + break; + case 21: + if ((0x7e0000007eL & l) != 0L && kind > 29) + kind = 29; + break; + case 22: + if ((0x14404410000000L & l) != 0L && kind > 29) + kind = 29; + break; + case 25: + jjAddStates(24, 26); + break; + case 30: + jjCheckNAddTwoStates(30, 31); + break; + case 32: + case 33: + jjCheckNAddTwoStates(33, 31); + break; + case 45: + if ((0x2000000020L & l) != 0L) + jjAddStates(36, 37); + break; + case 53: + if ((0x2000000020L & l) != 0L) + jjAddStates(38, 39); + break; + default : break; + } + } while(i != startsAt); + } + else + { + int hiByte = (int)(curChar >> 8); + int i1 = hiByte >> 6; + long l1 = 1L << (hiByte & 077); + int i2 = (curChar & 0xff) >> 6; + long l2 = 1L << (curChar & 077); + do + { + switch(jjstateSet[--i]) + { + case 0: + if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 29) + kind = 29; + break; + case 6: + if (jjCanMove_0(hiByte, i1, i2, l1, l2)) + jjAddStates(0, 2); + break; + case 25: + if (jjCanMove_0(hiByte, i1, i2, l1, l2)) + jjAddStates(24, 26); + break; + case 30: + if (jjCanMove_0(hiByte, i1, i2, l1, l2)) + jjCheckNAddTwoStates(30, 31); + break; + case 32: + case 33: + if (jjCanMove_0(hiByte, i1, i2, l1, l2)) + jjCheckNAddTwoStates(33, 31); + break; + default : break; + } + } while(i != startsAt); + } + if (kind != 0x7fffffff) + { + jjmatchedKind = kind; + jjmatchedPos = curPos; + kind = 0x7fffffff; + } + ++curPos; + if ((i = jjnewStateCnt) == (startsAt = 64 - (jjnewStateCnt = startsAt))) + return curPos; + try { curChar = input_stream.readChar(); } + catch(java.io.IOException e) { return curPos; } + } +} +static final int[] jjnextStates = { + 6, 7, 13, 40, 45, 51, 62, 36, 37, 39, 42, 44, 48, 50, 56, 58, + 59, 24, 29, 38, 43, 49, 57, 60, 25, 26, 28, 31, 32, 34, 17, 22, + 3, 4, 8, 14, 46, 47, 54, 55, +}; +private static final boolean jjCanMove_0(int hiByte, int i1, int i2, long l1, long l2) +{ + switch(hiByte) + { + case 0: + return ((jjbitVec2[i2] & l2) != 0L); + default : + if ((jjbitVec0[i1] & l1) != 0L) + return true; + return false; + } +} + +/** Token literal values. */ +public static final String[] jjstrLiteralImages = { +"", null, null, null, null, null, null, null, "\164\162\165\145", +"\146\141\154\163\145", "\156\165\154\154", "\173", "\175", "\133", "\135", "\54", "\72", "\56", +"\53", "\55", null, null, null, null, null, null, null, null, null, null, }; + +/** Lexer state names. */ +public static final String[] lexStateNames = { + "DEFAULT", +}; +static final long[] jjtoToken = { + 0x3f8fff01L, +}; +static final long[] jjtoSkip = { + 0xfeL, +}; +protected JavaCharStream input_stream; +private final int[] jjrounds = new int[64]; +private final int[] jjstateSet = new int[128]; +protected char curChar; +/** Constructor. */ +public JSONParserTokenManager(JavaCharStream stream){ + if (JavaCharStream.staticFlag) + throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer."); + input_stream = stream; +} + +/** Constructor. */ +public JSONParserTokenManager(JavaCharStream stream, int lexState){ + this(stream); + SwitchTo(lexState); +} + +/** Reinitialise parser. */ +public void ReInit(JavaCharStream stream) +{ + jjmatchedPos = jjnewStateCnt = 0; + curLexState = defaultLexState; + input_stream = stream; + ReInitRounds(); +} +private void ReInitRounds() +{ + int i; + jjround = 0x80000001; + for (i = 64; i-- > 0;) + jjrounds[i] = 0x80000000; +} + +/** Reinitialise parser. */ +public void ReInit(JavaCharStream stream, int lexState) +{ + ReInit(stream); + SwitchTo(lexState); +} + +/** Switch to specified lex state. */ +public void SwitchTo(int lexState) +{ + if (lexState >= 1 || lexState < 0) + throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE); + else + curLexState = lexState; +} + +protected Token jjFillToken() +{ + final Token t; + final String curTokenImage; + final int beginLine; + final int endLine; + final int beginColumn; + final int endColumn; + String im = jjstrLiteralImages[jjmatchedKind]; + curTokenImage = (im == null) ? input_stream.GetImage() : im; + beginLine = input_stream.getBeginLine(); + beginColumn = input_stream.getBeginColumn(); + endLine = input_stream.getEndLine(); + endColumn = input_stream.getEndColumn(); + t = Token.newToken(jjmatchedKind, curTokenImage); + + t.beginLine = beginLine; + t.endLine = endLine; + t.beginColumn = beginColumn; + t.endColumn = endColumn; + + return t; +} + +int curLexState = 0; +int defaultLexState = 0; +int jjnewStateCnt; +int jjround; +int jjmatchedPos; +int jjmatchedKind; + +/** Get the next Token. */ +public Token getNextToken() +{ + Token matchedToken; + int curPos = 0; + + EOFLoop : + for (;;) + { + try + { + curChar = input_stream.BeginToken(); + } + catch(java.io.IOException e) + { + jjmatchedKind = 0; + matchedToken = jjFillToken(); + return matchedToken; + } + + try { input_stream.backup(0); + while (curChar <= 13 && (0x3600L & (1L << curChar)) != 0L) + curChar = input_stream.BeginToken(); + } + catch (java.io.IOException e1) { continue EOFLoop; } + jjmatchedKind = 0x7fffffff; + jjmatchedPos = 0; + curPos = jjMoveStringLiteralDfa0_0(); + if (jjmatchedKind != 0x7fffffff) + { + if (jjmatchedPos + 1 < curPos) + input_stream.backup(curPos - jjmatchedPos - 1); + if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L) + { + matchedToken = jjFillToken(); + return matchedToken; + } + else + { + continue EOFLoop; + } + } + int error_line = input_stream.getEndLine(); + int error_column = input_stream.getEndColumn(); + String error_after = null; + boolean EOFSeen = false; + try { input_stream.readChar(); input_stream.backup(1); } + catch (java.io.IOException e1) { + EOFSeen = true; + error_after = curPos <= 1 ? "" : input_stream.GetImage(); + if (curChar == '\n' || curChar == '\r') { + error_line++; + error_column = 0; + } + else + error_column++; + } + if (!EOFSeen) { + input_stream.backup(1); + error_after = curPos <= 1 ? "" : input_stream.GetImage(); + } + throw new TokenMgrError(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrError.LEXICAL_ERROR); + } +} + +private void jjCheckNAdd(int state) +{ + if (jjrounds[state] != jjround) + { + jjstateSet[jjnewStateCnt++] = state; + jjrounds[state] = jjround; + } +} +private void jjAddStates(int start, int end) +{ + do { + jjstateSet[jjnewStateCnt++] = jjnextStates[start]; + } while (start++ != end); +} +private void jjCheckNAddTwoStates(int state1, int state2) +{ + jjCheckNAdd(state1); + jjCheckNAdd(state2); +} + +private void jjCheckNAddStates(int start, int end) +{ + do { + jjCheckNAdd(jjnextStates[start]); + } while (start++ != end); +} + +} diff --git a/src/org/mwnorman/json/JSONParserTreeConstants.java b/src/org/mwnorman/json/JSONParserTreeConstants.java new file mode 100644 index 0000000..fa8f77e --- /dev/null +++ b/src/org/mwnorman/json/JSONParserTreeConstants.java @@ -0,0 +1,13 @@ +/* Generated By:JavaCC: Do not edit this line. JSONParserTreeConstants.java Version 5.0 */ +package org.mwnorman.json; + +public interface JSONParserTreeConstants +{ + public int JJTVOID = 0; + + + public String[] jjtNodeName = { + "void", + }; +} +/* JavaCC - OriginalChecksum=9d522db2142fe3e365dc0205e328b44d (do not edit this line) */ diff --git a/src/org/mwnorman/json/JavaCharStream.java b/src/org/mwnorman/json/JavaCharStream.java new file mode 100644 index 0000000..61c14b9 --- /dev/null +++ b/src/org/mwnorman/json/JavaCharStream.java @@ -0,0 +1,638 @@ +/* Generated By:JavaCC: Do not edit this line. JavaCharStream.java Version 5.0 */ +/* JavaCCOptions:STATIC=false,SUPPORT_CLASS_VISIBILITY_PUBLIC=true */ +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; + +/** + * An implementation of interface CharStream, where the stream is assumed to + * contain only ASCII characters (with java-like unicode escape processing). + */ + +public +class JavaCharStream +{ + /** Whether parser is static. */ + public static final boolean staticFlag = false; + + static final int hexval(char c) throws java.io.IOException { + switch(c) + { + case '0' : + return 0; + case '1' : + return 1; + case '2' : + return 2; + case '3' : + return 3; + case '4' : + return 4; + case '5' : + return 5; + case '6' : + return 6; + case '7' : + return 7; + case '8' : + return 8; + case '9' : + return 9; + + case 'a' : + case 'A' : + return 10; + case 'b' : + case 'B' : + return 11; + case 'c' : + case 'C' : + return 12; + case 'd' : + case 'D' : + return 13; + case 'e' : + case 'E' : + return 14; + case 'f' : + case 'F' : + return 15; + } + + throw new java.io.IOException(); // Should never come here + } + +/** Position in buffer. */ + public int bufpos = -1; + int bufsize; + int available; + int tokenBegin; + protected int bufline[]; + protected int bufcolumn[]; + + protected int column = 0; + protected int line = 1; + + protected boolean prevCharIsCR = false; + protected boolean prevCharIsLF = false; + + protected java.io.Reader inputStream; + + protected char[] nextCharBuf; + protected char[] buffer; + protected int maxNextCharInd = 0; + protected int nextCharInd = -1; + protected int inBuf = 0; + protected int tabSize = 8; + + protected void setTabSize(int i) { tabSize = i; } + protected int getTabSize(int i) { return tabSize; } + + protected void ExpandBuff(boolean wrapAround) + { + char[] newbuffer = new char[bufsize + 2048]; + int newbufline[] = new int[bufsize + 2048]; + int newbufcolumn[] = new int[bufsize + 2048]; + + try + { + if (wrapAround) + { + System.arraycopy(buffer, tokenBegin, newbuffer, 0, bufsize - tokenBegin); + System.arraycopy(buffer, 0, newbuffer, bufsize - tokenBegin, bufpos); + buffer = newbuffer; + + System.arraycopy(bufline, tokenBegin, newbufline, 0, bufsize - tokenBegin); + System.arraycopy(bufline, 0, newbufline, bufsize - tokenBegin, bufpos); + bufline = newbufline; + + System.arraycopy(bufcolumn, tokenBegin, newbufcolumn, 0, bufsize - tokenBegin); + System.arraycopy(bufcolumn, 0, newbufcolumn, bufsize - tokenBegin, bufpos); + bufcolumn = newbufcolumn; + + bufpos += (bufsize - tokenBegin); + } + else + { + System.arraycopy(buffer, tokenBegin, newbuffer, 0, bufsize - tokenBegin); + buffer = newbuffer; + + System.arraycopy(bufline, tokenBegin, newbufline, 0, bufsize - tokenBegin); + bufline = newbufline; + + System.arraycopy(bufcolumn, tokenBegin, newbufcolumn, 0, bufsize - tokenBegin); + bufcolumn = newbufcolumn; + + bufpos -= tokenBegin; + } + } + catch (Throwable t) + { + throw new Error(t.getMessage()); + } + + available = (bufsize += 2048); + tokenBegin = 0; + } + + protected void FillBuff() throws java.io.IOException + { + int i; + if (maxNextCharInd == 4096) + maxNextCharInd = nextCharInd = 0; + + try { + if ((i = inputStream.read(nextCharBuf, maxNextCharInd, + 4096 - maxNextCharInd)) == -1) + { + inputStream.close(); + throw new java.io.IOException(); + } + else + maxNextCharInd += i; + return; + } + catch(java.io.IOException e) { + if (bufpos != 0) + { + --bufpos; + backup(0); + } + else + { + bufline[bufpos] = line; + bufcolumn[bufpos] = column; + } + throw e; + } + } + + protected char ReadByte() throws java.io.IOException + { + if (++nextCharInd >= maxNextCharInd) + FillBuff(); + + return nextCharBuf[nextCharInd]; + } + +/** @return starting character for token. */ + public char BeginToken() throws java.io.IOException + { + if (inBuf > 0) + { + --inBuf; + + if (++bufpos == bufsize) + bufpos = 0; + + tokenBegin = bufpos; + return buffer[bufpos]; + } + + tokenBegin = 0; + bufpos = -1; + + return readChar(); + } + + protected void AdjustBuffSize() + { + if (available == bufsize) + { + if (tokenBegin > 2048) + { + bufpos = 0; + available = tokenBegin; + } + else + ExpandBuff(false); + } + else if (available > tokenBegin) + available = bufsize; + else if ((tokenBegin - available) < 2048) + ExpandBuff(true); + else + available = tokenBegin; + } + + protected void UpdateLineColumn(char c) + { + column++; + + if (prevCharIsLF) + { + prevCharIsLF = false; + line += (column = 1); + } + else if (prevCharIsCR) + { + prevCharIsCR = false; + if (c == '\n') + { + prevCharIsLF = true; + } + else + line += (column = 1); + } + + switch (c) + { + case '\r' : + prevCharIsCR = true; + break; + case '\n' : + prevCharIsLF = true; + break; + case '\t' : + column--; + column += (tabSize - (column % tabSize)); + break; + default : + break; + } + + bufline[bufpos] = line; + bufcolumn[bufpos] = column; + } + +/** Read a character. */ + public char readChar() throws java.io.IOException + { + if (inBuf > 0) + { + --inBuf; + + if (++bufpos == bufsize) + bufpos = 0; + + return buffer[bufpos]; + } + + char c; + + if (++bufpos == available) + AdjustBuffSize(); + + if ((buffer[bufpos] = c = ReadByte()) == '\\') + { + UpdateLineColumn(c); + + int backSlashCnt = 1; + + for (;;) // Read all the backslashes + { + if (++bufpos == available) + AdjustBuffSize(); + + try + { + if ((buffer[bufpos] = c = ReadByte()) != '\\') + { + UpdateLineColumn(c); + // found a non-backslash char. + if ((c == 'u') && ((backSlashCnt & 1) == 1)) + { + if (--bufpos < 0) + bufpos = bufsize - 1; + + break; + } + + backup(backSlashCnt); + return '\\'; + } + } + catch(java.io.IOException e) + { + // We are returning one backslash so we should only backup (count-1) + if (backSlashCnt > 1) + backup(backSlashCnt-1); + + return '\\'; + } + + UpdateLineColumn(c); + backSlashCnt++; + } + + // Here, we have seen an odd number of backslash's followed by a 'u' + try + { + while ((c = ReadByte()) == 'u') + ++column; + + buffer[bufpos] = c = (char)(hexval(c) << 12 | + hexval(ReadByte()) << 8 | + hexval(ReadByte()) << 4 | + hexval(ReadByte())); + + column += 4; + } + catch(java.io.IOException e) + { + throw new Error("Invalid escape character at line " + line + + " column " + column + "."); + } + + if (backSlashCnt == 1) + return c; + else + { + backup(backSlashCnt - 1); + return '\\'; + } + } + else + { + UpdateLineColumn(c); + return c; + } + } + + @Deprecated + /** + * @deprecated + * @see #getEndColumn + */ + public int getColumn() { + return bufcolumn[bufpos]; + } + + @Deprecated + /** + * @deprecated + * @see #getEndLine + */ + public int getLine() { + return bufline[bufpos]; + } + +/** Get end column. */ + public int getEndColumn() { + return bufcolumn[bufpos]; + } + +/** Get end line. */ + public int getEndLine() { + return bufline[bufpos]; + } + +/** @return column of token start */ + public int getBeginColumn() { + return bufcolumn[tokenBegin]; + } + +/** @return line number of token start */ + public int getBeginLine() { + return bufline[tokenBegin]; + } + +/** Retreat. */ + public void backup(int amount) { + + inBuf += amount; + if ((bufpos -= amount) < 0) + bufpos += bufsize; + } + +/** Constructor. */ + public JavaCharStream(java.io.Reader dstream, + int startline, int startcolumn, int buffersize) + { + inputStream = dstream; + line = startline; + column = startcolumn - 1; + + available = bufsize = buffersize; + buffer = new char[buffersize]; + bufline = new int[buffersize]; + bufcolumn = new int[buffersize]; + nextCharBuf = new char[4096]; + } + +/** Constructor. */ + public JavaCharStream(java.io.Reader dstream, + int startline, int startcolumn) + { + this(dstream, startline, startcolumn, 4096); + } + +/** Constructor. */ + public JavaCharStream(java.io.Reader dstream) + { + this(dstream, 1, 1, 4096); + } +/** Reinitialise. */ + public void ReInit(java.io.Reader dstream, + int startline, int startcolumn, int buffersize) + { + inputStream = dstream; + line = startline; + column = startcolumn - 1; + + if (buffer == null || buffersize != buffer.length) + { + available = bufsize = buffersize; + buffer = new char[buffersize]; + bufline = new int[buffersize]; + bufcolumn = new int[buffersize]; + nextCharBuf = new char[4096]; + } + prevCharIsLF = prevCharIsCR = false; + tokenBegin = inBuf = maxNextCharInd = 0; + nextCharInd = bufpos = -1; + } + +/** Reinitialise. */ + public void ReInit(java.io.Reader dstream, + int startline, int startcolumn) + { + ReInit(dstream, startline, startcolumn, 4096); + } + +/** Reinitialise. */ + public void ReInit(java.io.Reader dstream) + { + ReInit(dstream, 1, 1, 4096); + } +/** Constructor. */ + public JavaCharStream(java.io.InputStream dstream, String encoding, int startline, + int startcolumn, int buffersize) throws java.io.UnsupportedEncodingException + { + this(encoding == null ? new java.io.InputStreamReader(dstream) : new java.io.InputStreamReader(dstream, encoding), startline, startcolumn, buffersize); + } + +/** Constructor. */ + public JavaCharStream(java.io.InputStream dstream, int startline, + int startcolumn, int buffersize) + { + this(new java.io.InputStreamReader(dstream), startline, startcolumn, 4096); + } + +/** Constructor. */ + public JavaCharStream(java.io.InputStream dstream, String encoding, int startline, + int startcolumn) throws java.io.UnsupportedEncodingException + { + this(dstream, encoding, startline, startcolumn, 4096); + } + +/** Constructor. */ + public JavaCharStream(java.io.InputStream dstream, int startline, + int startcolumn) + { + this(dstream, startline, startcolumn, 4096); + } + +/** Constructor. */ + public JavaCharStream(java.io.InputStream dstream, String encoding) throws java.io.UnsupportedEncodingException + { + this(dstream, encoding, 1, 1, 4096); + } + +/** Constructor. */ + public JavaCharStream(java.io.InputStream dstream) + { + this(dstream, 1, 1, 4096); + } + +/** Reinitialise. */ + public void ReInit(java.io.InputStream dstream, String encoding, int startline, + int startcolumn, int buffersize) throws java.io.UnsupportedEncodingException + { + ReInit(encoding == null ? new java.io.InputStreamReader(dstream) : new java.io.InputStreamReader(dstream, encoding), startline, startcolumn, buffersize); + } + +/** Reinitialise. */ + public void ReInit(java.io.InputStream dstream, int startline, + int startcolumn, int buffersize) + { + ReInit(new java.io.InputStreamReader(dstream), startline, startcolumn, buffersize); + } +/** Reinitialise. */ + public void ReInit(java.io.InputStream dstream, String encoding, int startline, + int startcolumn) throws java.io.UnsupportedEncodingException + { + ReInit(dstream, encoding, startline, startcolumn, 4096); + } +/** Reinitialise. */ + public void ReInit(java.io.InputStream dstream, int startline, + int startcolumn) + { + ReInit(dstream, startline, startcolumn, 4096); + } +/** Reinitialise. */ + public void ReInit(java.io.InputStream dstream, String encoding) throws java.io.UnsupportedEncodingException + { + ReInit(dstream, encoding, 1, 1, 4096); + } + +/** Reinitialise. */ + public void ReInit(java.io.InputStream dstream) + { + ReInit(dstream, 1, 1, 4096); + } + + /** @return token image as String */ + public String GetImage() + { + if (bufpos >= tokenBegin) + return new String(buffer, tokenBegin, bufpos - tokenBegin + 1); + else + return new String(buffer, tokenBegin, bufsize - tokenBegin) + + new String(buffer, 0, bufpos + 1); + } + + /** @return suffix */ + public char[] GetSuffix(int len) + { + char[] ret = new char[len]; + + if ((bufpos + 1) >= len) + System.arraycopy(buffer, bufpos - len + 1, ret, 0, len); + else + { + System.arraycopy(buffer, bufsize - (len - bufpos - 1), ret, 0, + len - bufpos - 1); + System.arraycopy(buffer, 0, ret, len - bufpos - 1, bufpos + 1); + } + + return ret; + } + + /** Set buffers back to null when finished. */ + public void Done() + { + nextCharBuf = null; + buffer = null; + bufline = null; + bufcolumn = null; + } + + /** + * Method to adjust line and column numbers for the start of a token. + */ + public void adjustBeginLineColumn(int newLine, int newCol) + { + int start = tokenBegin; + int len; + + if (bufpos >= tokenBegin) + { + len = bufpos - tokenBegin + inBuf + 1; + } + else + { + len = bufsize - tokenBegin + bufpos + 1 + inBuf; + } + + int i = 0, j = 0, k = 0; + int nextColDiff = 0, columnDiff = 0; + + while (i < len && bufline[j = start % bufsize] == bufline[k = ++start % bufsize]) + { + bufline[j] = newLine; + nextColDiff = columnDiff + bufcolumn[k] - bufcolumn[j]; + bufcolumn[j] = newCol + columnDiff; + columnDiff = nextColDiff; + i++; + } + + if (i < len) + { + bufline[j] = newLine++; + bufcolumn[j] = newCol + columnDiff; + + while (i++ < len) + { + if (bufline[j = start % bufsize] != bufline[++start % bufsize]) + bufline[j] = newLine++; + else + bufline[j] = newLine; + } + } + + line = bufline[j]; + column = bufcolumn[j]; + } + +} +/* JavaCC - OriginalChecksum=1391554e908b6309c4c091e9fa9172b1 (do not edit this line) */ diff --git a/src/org/mwnorman/json/Node.java b/src/org/mwnorman/json/Node.java new file mode 100644 index 0000000..cb4488a --- /dev/null +++ b/src/org/mwnorman/json/Node.java @@ -0,0 +1,37 @@ +/* Generated By:JJTree: Do not edit this line. Node.java Version 4.3 */ +/* JavaCCOptions:MULTI=false,NODE_USES_PARSER=false,VISITOR=false,TRACK_TOKENS=false,NODE_PREFIX=AST,NODE_EXTENDS=,NODE_FACTORY=,SUPPORT_CLASS_VISIBILITY_PUBLIC=true */ +package org.mwnorman.json; + +/* All AST nodes must implement this interface. It provides basic + machinery for constructing the parent and child relationships + between nodes. */ + +public +@SuppressWarnings("all") +interface Node { + + /** This method is called after the node has been made the current + node. It indicates that child nodes can now be added to it. */ + public void jjtOpen(); + + /** This method is called after all the child nodes have been + added. */ + public void jjtClose(); + + /** This pair of methods are used to inform the node of its + parent. */ + public void jjtSetParent(Node n); + public Node jjtGetParent(); + + /** This method tells the node to add its argument to the node's + list of children. */ + public void jjtAddChild(Node n, int i); + + /** This method returns a child node. The children are numbered + from zero, left to right. */ + public Node jjtGetChild(int i); + + /** Return the number of children the node has. */ + public int jjtGetNumChildren(); +} +/* JavaCC - OriginalChecksum=a7cb1032946184433a42bc8a79bae92e (do not edit this line) */ diff --git a/src/org/mwnorman/json/ParseException.java b/src/org/mwnorman/json/ParseException.java new file mode 100644 index 0000000..052f09e --- /dev/null +++ b/src/org/mwnorman/json/ParseException.java @@ -0,0 +1,208 @@ +/* Generated By:JavaCC: Do not edit this line. ParseException.java Version 5.0 */ +/* JavaCCOptions:KEEP_LINE_COL=null */ +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; + +/** + * This exception is thrown when parse errors are encountered. + * You can explicitly create objects of this exception type by + * calling the method generateParseException in the generated + * parser. + * + * You can modify this class to customize your error reporting + * mechanisms so long as you retain the public fields. + */ +public class ParseException extends Exception { + + /** + * The version identifier for this Serializable class. + * Increment only if the serialized form of the + * class changes. + */ + private static final long serialVersionUID = 1L; + + /** + * This constructor is used by the method "generateParseException" + * in the generated parser. Calling this constructor generates + * a new object of this type with the fields "currentToken", + * "expectedTokenSequences", and "tokenImage" set. + */ + public ParseException(Token currentTokenVal, + int[][] expectedTokenSequencesVal, + String[] tokenImageVal + ) + { + super(initialise(currentTokenVal, expectedTokenSequencesVal, tokenImageVal)); + currentToken = currentTokenVal; + expectedTokenSequences = expectedTokenSequencesVal; + tokenImage = tokenImageVal; + } + + /** + * The following constructors are for use by you for whatever + * purpose you can think of. Constructing the exception in this + * manner makes the exception behave in the normal way - i.e., as + * documented in the class "Throwable". The fields "errorToken", + * "expectedTokenSequences", and "tokenImage" do not contain + * relevant information. The JavaCC generated code does not use + * these constructors. + */ + + public ParseException() { + super(); + } + + /** Constructor with message. */ + public ParseException(String message) { + super(message); + } + + + /** + * This is the last token that has been consumed successfully. If + * this object has been created due to a parse error, the token + * followng this token will (therefore) be the first error token. + */ + public Token currentToken; + + /** + * Each entry in this array is an array of integers. Each array + * of integers represents a sequence of tokens (by their ordinal + * values) that is expected at this point of the parse. + */ + public int[][] expectedTokenSequences; + + /** + * This is a reference to the "tokenImage" array of the generated + * parser within which the parse error occurred. This array is + * defined in the generated ...Constants interface. + */ + public String[] tokenImage; + + /** + * It uses "currentToken" and "expectedTokenSequences" to generate a parse + * error message and returns it. If this object has been created + * due to a parse error, and you do not catch it (it gets thrown + * from the parser) the correct error message + * gets displayed. + */ + private static String initialise(Token currentToken, + int[][] expectedTokenSequences, + String[] tokenImage) { + String eol = System.getProperty("line.separator", "\n"); + StringBuffer expected = new StringBuffer(); + int maxSize = 0; + for (int i = 0; i < expectedTokenSequences.length; i++) { + if (maxSize < expectedTokenSequences[i].length) { + maxSize = expectedTokenSequences[i].length; + } + for (int j = 0; j < expectedTokenSequences[i].length; j++) { + expected.append(tokenImage[expectedTokenSequences[i][j]]).append(' '); + } + if (expectedTokenSequences[i][expectedTokenSequences[i].length - 1] != 0) { + expected.append("..."); + } + expected.append(eol).append(" "); + } + String retval = "Encountered \""; + Token tok = currentToken.next; + for (int i = 0; i < maxSize; i++) { + if (i != 0) retval += " "; + if (tok.kind == 0) { + retval += tokenImage[0]; + break; + } + retval += " " + tokenImage[tok.kind]; + retval += " \""; + retval += add_escapes(tok.image); + retval += " \""; + tok = tok.next; + } + retval += "\" at line " + currentToken.next.beginLine + ", column " + currentToken.next.beginColumn; + retval += "." + eol; + if (expectedTokenSequences.length == 1) { + retval += "Was expecting:" + eol + " "; + } else { + retval += "Was expecting one of:" + eol + " "; + } + retval += expected.toString(); + return retval; + } + + /** + * The end of line string for this machine. + */ + protected String eol = System.getProperty("line.separator", "\n"); + + /** + * Used to convert raw characters to their escaped version + * when these raw version cannot be used as part of an ASCII + * string literal. + */ + static String add_escapes(String str) { + StringBuffer retval = new StringBuffer(); + char ch; + for (int i = 0; i < str.length(); i++) { + switch (str.charAt(i)) + { + case 0 : + continue; + case '\b': + retval.append("\\b"); + continue; + case '\t': + retval.append("\\t"); + continue; + case '\n': + retval.append("\\n"); + continue; + case '\f': + retval.append("\\f"); + continue; + case '\r': + retval.append("\\r"); + continue; + case '\"': + retval.append("\\\""); + continue; + case '\'': + retval.append("\\\'"); + continue; + case '\\': + retval.append("\\\\"); + continue; + default: + if ((ch = str.charAt(i)) < 0x20 || ch > 0x7e) { + String s = "0000" + Integer.toString(ch, 16); + retval.append("\\u" + s.substring(s.length() - 4, s.length())); + } else { + retval.append(ch); + } + continue; + } + } + return retval.toString(); + } + +} +/* JavaCC - OriginalChecksum=6498e81e53f28bcc3b6e8bcf8a054e31 (do not edit this line) */ diff --git a/src/org/mwnorman/json/Token.java b/src/org/mwnorman/json/Token.java new file mode 100644 index 0000000..cf5428a --- /dev/null +++ b/src/org/mwnorman/json/Token.java @@ -0,0 +1,152 @@ +/* Generated By:JavaCC: Do not edit this line. Token.java Version 5.0 */ +/* JavaCCOptions:TOKEN_EXTENDS=,KEEP_LINE_COL=null,SUPPORT_CLASS_VISIBILITY_PUBLIC=true */ +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; + +/** + * Describes the input token stream. + */ + +public class Token implements java.io.Serializable { + + /** + * The version identifier for this Serializable class. + * Increment only if the serialized form of the + * class changes. + */ + private static final long serialVersionUID = 1L; + + /** + * An integer that describes the kind of this token. This numbering + * system is determined by JavaCCParser, and a table of these numbers is + * stored in the file ...Constants.java. + */ + public int kind; + + /** The line number of the first character of this Token. */ + public int beginLine; + /** The column number of the first character of this Token. */ + public int beginColumn; + /** The line number of the last character of this Token. */ + public int endLine; + /** The column number of the last character of this Token. */ + public int endColumn; + + /** + * The string image of the token. + */ + public String image; + + /** + * A reference to the next regular (non-special) token from the input + * stream. If this is the last token from the input stream, or if the + * token manager has not read tokens beyond this one, this field is + * set to null. This is true only if this token is also a regular + * token. Otherwise, see below for a description of the contents of + * this field. + */ + public Token next; + + /** + * This field is used to access special tokens that occur prior to this + * token, but after the immediately preceding regular (non-special) token. + * If there are no such special tokens, this field is set to null. + * When there are more than one such special token, this field refers + * to the last of these special tokens, which in turn refers to the next + * previous special token through its specialToken field, and so on + * until the first special token (whose specialToken field is null). + * The next fields of special tokens refer to other special tokens that + * immediately follow it (without an intervening regular token). If there + * is no such token, this field is null. + */ + public Token specialToken; + + /** + * An optional attribute value of the Token. + * Tokens which are not used as syntactic sugar will often contain + * meaningful values that will be used later on by the compiler or + * interpreter. This attribute value is often different from the image. + * Any subclass of Token that actually wants to return a non-null value can + * override this method as appropriate. + */ + public Object getValue() { + return null; + } + + /** + * No-argument constructor + */ + public Token() {} + + /** + * Constructs a new token for the specified Image. + */ + public Token(int kind) + { + this(kind, null); + } + + /** + * Constructs a new token for the specified Image and Kind. + */ + public Token(int kind, String image) + { + this.kind = kind; + this.image = image; + } + + /** + * Returns the image. + */ + public String toString() + { + return image; + } + + /** + * Returns a new Token object, by default. However, if you want, you + * can create and return subclass objects based on the value of ofKind. + * Simply add the cases to the switch for all those special cases. + * For example, if you have a subclass of Token called IDToken that + * you want to create if ofKind is ID, simply add something like : + * + * case MyParserConstants.ID : return new IDToken(ofKind, image); + * + * to the following switch statement. Then you can cast matchedToken + * variable to the appropriate type and use sit in your lexical actions. + */ + public static Token newToken(int ofKind, String image) + { + switch(ofKind) + { + default : return new Token(ofKind, image); + } + } + + public static Token newToken(int ofKind) + { + return newToken(ofKind, null); + } + +} +/* JavaCC - OriginalChecksum=bd54ec7bd7a568bb0905216882a204c4 (do not edit this line) */ diff --git a/src/org/mwnorman/json/TokenMgrError.java b/src/org/mwnorman/json/TokenMgrError.java new file mode 100644 index 0000000..6035ea2 --- /dev/null +++ b/src/org/mwnorman/json/TokenMgrError.java @@ -0,0 +1,168 @@ +/* Generated By:JavaCC: Do not edit this line. TokenMgrError.java Version 5.0 */ +/* JavaCCOptions: */ +/* + * This software is licensed under the terms of the ISC License. + * (ISCL http://www.opensource.org/licenses/isc-license.txt + * It is functionally equivalent to the 2-clause BSD licence, + * with language "made unnecessary by the Berne convention" removed). + * + * Copyright (c) 2011, Mike Norman + * + * Permission to use, copy, modify, and/or distribute this software for any + * purpose with or without fee is hereby granted, provided that the above + * copyright notice and this permission notice appear in all copies. + * + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY + * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE + * USE OR PERFORMANCE OF THIS SOFTWARE. + * + */ +package org.mwnorman.json; + +/** Token Manager Error. */ +public class TokenMgrError extends Error +{ + + /** + * The version identifier for this Serializable class. + * Increment only if the serialized form of the + * class changes. + */ + private static final long serialVersionUID = 1L; + + /* + * Ordinals for various reasons why an Error of this type can be thrown. + */ + + /** + * Lexical error occurred. + */ + static final int LEXICAL_ERROR = 0; + + /** + * An attempt was made to create a second instance of a static token manager. + */ + static final int STATIC_LEXER_ERROR = 1; + + /** + * Tried to change to an invalid lexical state. + */ + static final int INVALID_LEXICAL_STATE = 2; + + /** + * Detected (and bailed out of) an infinite loop in the token manager. + */ + static final int LOOP_DETECTED = 3; + + /** + * Indicates the reason why the exception is thrown. It will have + * one of the above 4 values. + */ + int errorCode; + + /** + * Replaces unprintable characters by their escaped (or unicode escaped) + * equivalents in the given string + */ + protected static final String addEscapes(String str) { + StringBuffer retval = new StringBuffer(); + char ch; + for (int i = 0; i < str.length(); i++) { + switch (str.charAt(i)) + { + case 0 : + continue; + case '\b': + retval.append("\\b"); + continue; + case '\t': + retval.append("\\t"); + continue; + case '\n': + retval.append("\\n"); + continue; + case '\f': + retval.append("\\f"); + continue; + case '\r': + retval.append("\\r"); + continue; + case '\"': + retval.append("\\\""); + continue; + case '\'': + retval.append("\\\'"); + continue; + case '\\': + retval.append("\\\\"); + continue; + default: + if ((ch = str.charAt(i)) < 0x20 || ch > 0x7e) { + String s = "0000" + Integer.toString(ch, 16); + retval.append("\\u" + s.substring(s.length() - 4, s.length())); + } else { + retval.append(ch); + } + continue; + } + } + return retval.toString(); + } + + /** + * Returns a detailed message for the Error when it is thrown by the + * token manager to indicate a lexical error. + * Parameters : + * EOFSeen : indicates if EOF caused the lexical error + * curLexState : lexical state in which this error occurred + * errorLine : line number when the error occurred + * errorColumn : column number when the error occurred + * errorAfter : prefix that was seen before this error occurred + * curchar : the offending character + * Note: You can customize the lexical error message by modifying this method. + */ + protected static String LexicalError(boolean EOFSeen, int lexState, int errorLine, int errorColumn, String errorAfter, char curChar) { + return("Lexical error at line " + + errorLine + ", column " + + errorColumn + ". Encountered: " + + (EOFSeen ? " " : ("\"" + addEscapes(String.valueOf(curChar)) + "\"") + " (" + (int)curChar + "), ") + + "after : \"" + addEscapes(errorAfter) + "\""); + } + + /** + * You can also modify the body of this method to customize your error messages. + * For example, cases like LOOP_DETECTED and INVALID_LEXICAL_STATE are not + * of end-users concern, so you can return something like : + * + * "Internal Error : Please file a bug report .... " + * + * from this method for such cases in the release version of your parser. + */ + public String getMessage() { + return super.getMessage(); + } + + /* + * Constructors of various flavors follow. + */ + + /** No arg constructor. */ + public TokenMgrError() { + } + + /** Constructor with message and reason. */ + public TokenMgrError(String message, int reason) { + super(message); + errorCode = reason; + } + + /** Full Constructor. */ + public TokenMgrError(boolean EOFSeen, int lexState, int errorLine, int errorColumn, String errorAfter, char curChar, int reason) { + this(LexicalError(EOFSeen, lexState, errorLine, errorColumn, errorAfter, curChar), reason); + } +} +/* JavaCC - OriginalChecksum=7c7cb185f0998ad9432b11845afdd2cb (do not edit this line) */