)(parser_stack.get(parser_top-0)).value;
-
- RESULT = parser.createStepPattern(Axis.CHILD, nt, pp);
-
- parser_result = new Symbol(32/*StepPattern*/, (parser_stack.get(parser_top-1)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("decendant");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 18: // StepPattern ::= NodeTestPattern
- {
- StepPattern RESULT = null;
- int ntleft = (parser_stack.get(parser_top-0)).left;
- int ntright = (parser_stack.get(parser_top-0)).right;
- Object nt = parser_stack.get(parser_top-0).value;
-
- RESULT = parser.createStepPattern(Axis.CHILD, nt, null);
-
- parser_result = new Symbol(32/*StepPattern*/, (parser_stack.get(parser_top-0)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 17: // RelativePathPattern ::= StepPattern DSLASH RelativePathPattern
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 132: // QName ::= DESCENDANTORSELF
{
- RelativePathPattern RESULT = null;
- int spleft = (parser_stack.get(parser_top-2)).left;
- int spright = (parser_stack.get(parser_top-2)).right;
- StepPattern sp = (StepPattern)(parser_stack.get(parser_top-2)).value;
- int rppleft = (parser_stack.get(parser_top-0)).left;
- int rppright = (parser_stack.get(parser_top-0)).right;
- RelativePathPattern rpp = (RelativePathPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = new AncestorPattern(sp, rpp);
- parser_result = new Symbol(31/*RelativePathPattern*/, (parser_stack.get(parser_top-2)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("decendant-or-self");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 16: // RelativePathPattern ::= StepPattern SLASH RelativePathPattern
- {
- RelativePathPattern RESULT = null;
- int spleft = (parser_stack.get(parser_top-2)).left;
- int spright = (parser_stack.get(parser_top-2)).right;
- StepPattern sp = (StepPattern)(parser_stack.get(parser_top-2)).value;
- int rppleft = (parser_stack.get(parser_top-0)).left;
- int rppright = (parser_stack.get(parser_top-0)).right;
- RelativePathPattern rpp = (RelativePathPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = new ParentPattern(sp, rpp);
- parser_result = new Symbol(31/*RelativePathPattern*/, (parser_stack.get(parser_top-2)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 15: // RelativePathPattern ::= StepPattern
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 133: // QName ::= FOLLOWING
{
- RelativePathPattern RESULT = null;
- int spleft = (parser_stack.get(parser_top-0)).left;
- int spright = (parser_stack.get(parser_top-0)).right;
- StepPattern sp = (StepPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = sp;
- parser_result = new Symbol(31/*RelativePathPattern*/, (parser_stack.get(parser_top-0)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("following");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 14: // ProcessingInstructionPattern ::= PIPARAM LPAREN Literal RPAREN
- {
- StepPattern RESULT = null;
- int lleft = (parser_stack.get(parser_top-1)).left;
- int lright = (parser_stack.get(parser_top-1)).right;
- String l = (String)(parser_stack.get(parser_top-1)).value;
- RESULT = new ProcessingInstructionPattern(l);
- parser_result = new Symbol(30/*ProcessingInstructionPattern*/, (parser_stack.get(parser_top-3)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 13: // IdKeyPattern ::= KEY LPAREN Literal COMMA Literal RPAREN
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 134: // QName ::= FOLLOWINGSIBLING
{
- IdKeyPattern RESULT = null;
- int l1left = (parser_stack.get(parser_top-3)).left;
- int l1right = (parser_stack.get(parser_top-3)).right;
- String l1 = (String)(parser_stack.get(parser_top-3)).value;
- int l2left = (parser_stack.get(parser_top-1)).left;
- int l2right = (parser_stack.get(parser_top-1)).right;
- String l2 = (String)(parser_stack.get(parser_top-1)).value;
- RESULT = new KeyPattern(l1, l2);
- parser_result = new Symbol(27/*IdKeyPattern*/, (parser_stack.get(parser_top-5)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("following-sibling");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 12: // IdKeyPattern ::= ID LPAREN Literal RPAREN
- {
- IdKeyPattern RESULT = null;
- int lleft = (parser_stack.get(parser_top-1)).left;
- int lright = (parser_stack.get(parser_top-1)).right;
- String l = (String)(parser_stack.get(parser_top-1)).value;
- RESULT = new IdPattern(l);
- parser.setHasIdCall(true);
-
- parser_result = new Symbol(27/*IdKeyPattern*/, (parser_stack.get(parser_top-3)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 11: // LocationPathPattern ::= RelativePathPattern
- {
- Pattern RESULT = null;
- int rppleft = (parser_stack.get(parser_top-0)).left;
- int rppright = (parser_stack.get(parser_top-0)).right;
- RelativePathPattern rpp = (RelativePathPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = rpp;
- parser_result = new Symbol(29/*LocationPathPattern*/, (parser_stack.get(parser_top-0)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 10: // LocationPathPattern ::= DSLASH RelativePathPattern
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 135: // QName ::= NAMESPACE
{
- Pattern RESULT = null;
- int rppleft = (parser_stack.get(parser_top-0)).left;
- int rppright = (parser_stack.get(parser_top-0)).right;
- RelativePathPattern rpp = (RelativePathPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = new AncestorPattern(rpp);
- parser_result = new Symbol(29/*LocationPathPattern*/, (parser_stack.get(parser_top-1)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("namespace");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 9: // LocationPathPattern ::= IdKeyPattern DSLASH RelativePathPattern
- {
- Pattern RESULT = null;
- int ikpleft = (parser_stack.get(parser_top-2)).left;
- int ikpright = (parser_stack.get(parser_top-2)).right;
- IdKeyPattern ikp = (IdKeyPattern)(parser_stack.get(parser_top-2)).value;
- int rppleft = (parser_stack.get(parser_top-0)).left;
- int rppright = (parser_stack.get(parser_top-0)).right;
- RelativePathPattern rpp = (RelativePathPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = new AncestorPattern(ikp, rpp);
- parser_result = new Symbol(29/*LocationPathPattern*/, (parser_stack.get(parser_top-2)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 8: // LocationPathPattern ::= IdKeyPattern SLASH RelativePathPattern
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 136: // QName ::= PARENT
{
- Pattern RESULT = null;
- int ikpleft = (parser_stack.get(parser_top-2)).left;
- int ikpright = (parser_stack.get(parser_top-2)).right;
- IdKeyPattern ikp = (IdKeyPattern)(parser_stack.get(parser_top-2)).value;
- int rppleft = (parser_stack.get(parser_top-0)).left;
- int rppright = (parser_stack.get(parser_top-0)).right;
- RelativePathPattern rpp = (RelativePathPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = new ParentPattern(ikp, rpp);
- parser_result = new Symbol(29/*LocationPathPattern*/, (parser_stack.get(parser_top-2)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("parent");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 7: // LocationPathPattern ::= IdKeyPattern
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 137: // QName ::= PRECEDING
{
- Pattern RESULT = null;
- int ikpleft = (parser_stack.get(parser_top-0)).left;
- int ikpright = (parser_stack.get(parser_top-0)).right;
- IdKeyPattern ikp = (IdKeyPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = ikp;
- parser_result = new Symbol(29/*LocationPathPattern*/, (parser_stack.get(parser_top-0)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("preceding");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 6: // LocationPathPattern ::= SLASH RelativePathPattern
- {
- Pattern RESULT = null;
- int rppleft = (parser_stack.get(parser_top-0)).left;
- int rppright = (parser_stack.get(parser_top-0)).right;
- RelativePathPattern rpp = (RelativePathPattern)(parser_stack.get(parser_top-0)).value;
- RESULT = new AbsolutePathPattern(rpp);
- parser_result = new Symbol(29/*LocationPathPattern*/, (parser_stack.get(parser_top-1)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 5: // LocationPathPattern ::= SLASH
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 138: // QName ::= PRECEDINGSIBLING
{
- Pattern RESULT = null;
- RESULT = new AbsolutePathPattern(null);
- parser_result = new Symbol(29/*LocationPathPattern*/, (parser_stack.get(parser_top-0)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("preceding-sibling");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 4: // Pattern ::= LocationPathPattern VBAR Pattern
- {
- Pattern RESULT = null;
- int lppleft = (parser_stack.get(parser_top-2)).left;
- int lppright = (parser_stack.get(parser_top-2)).right;
- Pattern lpp = (Pattern)(parser_stack.get(parser_top-2)).value;
- int pleft = (parser_stack.get(parser_top-0)).left;
- int pright = (parser_stack.get(parser_top-0)).right;
- Pattern p = (Pattern)(parser_stack.get(parser_top-0)).value;
- RESULT = new AlternativePattern(lpp, p);
- parser_result = new Symbol(28/*Pattern*/, (parser_stack.get(parser_top-2)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 3: // Pattern ::= LocationPathPattern
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 139: // QName ::= SELF
{
- Pattern RESULT = null;
- int lppleft = (parser_stack.get(parser_top-0)).left;
- int lppright = (parser_stack.get(parser_top-0)).right;
- Pattern lpp = (Pattern)(parser_stack.get(parser_top-0)).value;
- RESULT = lpp;
- parser_result = new Symbol(28/*Pattern*/, (parser_stack.get(parser_top-0)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("self");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 2: // TopLevel ::= EXPRESSION Expr
- {
- SyntaxTreeNode RESULT = null;
- int exprleft = (parser_stack.get(parser_top-0)).left;
- int exprright = (parser_stack.get(parser_top-0)).right;
- Expression expr = (Expression)(parser_stack.get(parser_top-0)).value;
- RESULT = expr;
- parser_result = new Symbol(1/*TopLevel*/, (parser_stack.get(parser_top-1)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- return parser_result;
-
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 1: // TopLevel ::= PATTERN Pattern
+ /*. . . . . . . . . . . . . . . . . . . .*/
+ case 140: // QName ::= ID
{
- SyntaxTreeNode RESULT = null;
- int patternleft = (parser_stack.get(parser_top-0)).left;
- int patternright = (parser_stack.get(parser_top-0)).right;
- Pattern pattern = (Pattern)(parser_stack.get(parser_top-0)).value;
- RESULT = pattern;
- parser_result = new Symbol(1/*TopLevel*/, (parser_stack.get(parser_top-1)).left, (parser_stack.get(parser_top-0)).right, RESULT);
+ QName result = parser.getQNameIgnoreDefaultNs("id");
+ parser_result = new Symbol(37, (parser_stack.get(parser_top - 0)).left,
+ (parser_stack.get(parser_top - 0)).right, result);
}
- return parser_result;
+ return parser_result;
- /*. . . . . . . . . . . . . . . . . . . .*/
- case 0: // $START ::= TopLevel EOF
- {
- Object RESULT = null;
- int start_valleft = (parser_stack.get(parser_top-1)).left;
- int start_valright = (parser_stack.get(parser_top-1)).right;
- SyntaxTreeNode start_val = (SyntaxTreeNode)(parser_stack.get(parser_top-1)).value;
- RESULT = start_val;
- parser_result = new Symbol(0/*$START*/, (parser_stack.get(parser_top-1)).left, (parser_stack.get(parser_top-0)).right, RESULT);
- }
- /* ACCEPT */
- parser_parser.done_parsing();
- return parser_result;
-
- /* . . . . . .*/
- default:
- throw new Exception(
- "Invalid action number found in internal parse table");
+ /* . . . . . .*/
+ default:
+ throw new Exception(
+ "Invalid action number found in internal parse table");
}
}
diff -r 71a84cee0c39 -r b470da55a673 src/java.xml/share/legal/jcup.md
--- a/src/java.xml/share/legal/jcup.md Thu Nov 21 14:15:31 2019 -0800
+++ b/src/java.xml/share/legal/jcup.md Fri Nov 22 00:29:48 2019 +0000
@@ -1,9 +1,9 @@
-## CUP Parser Generator for Java v 0.10k
+## CUP Parser Generator for Java v 0.11b
### CUP Parser Generator License
-Copyright 1996-1999 by Scott Hudson, Frank Flannery, C. Scott Ananian
+Copyright 1996-2015 by Scott Hudson, Frank Flannery, C. Scott Ananian, Michael Petter
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted, provided