yukigo-prolog-parser 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.mocharc.json +8 -0
- package/CHANGELOG.md +20 -0
- package/dist/index.d.ts +1 -0
- package/dist/index.js +2 -0
- package/dist/index.js.map +1 -0
- package/dist/parser/grammar.d.ts +28 -0
- package/dist/parser/grammar.js +141 -0
- package/dist/parser/grammar.js.map +1 -0
- package/dist/parser/lexer.d.ts +39 -0
- package/dist/parser/lexer.js +38 -0
- package/dist/parser/lexer.js.map +1 -0
- package/dist/parser/parser.d.ts +5 -0
- package/dist/parser/parser.js +31 -0
- package/dist/parser/parser.js.map +1 -0
- package/package.json +31 -0
- package/src/index.ts +1 -0
- package/src/parser/grammar.ne +166 -0
- package/src/parser/grammar.ts +219 -0
- package/src/parser/lexer.ts +39 -0
- package/src/parser/parser.ts +35 -0
- package/src/std.pl +119 -0
- package/tests/parser.spec.ts +830 -0
- package/tsconfig.json +18 -0
package/.mocharc.json
ADDED
package/CHANGELOG.md
ADDED
|
@@ -0,0 +1,20 @@
|
|
|
1
|
+
## 0.1.0 (2025-12-09)
|
|
2
|
+
|
|
3
|
+
### 🚀 Features
|
|
4
|
+
|
|
5
|
+
- **yukigo:** Nx Release added ([0bee88f](https://github.com/miyukiproject/yukigo/commit/0bee88f))
|
|
6
|
+
- **LogicEngine:** Added LogicEngine with unification algorithm ([57b48a0](https://github.com/miyukiproject/yukigo/commit/57b48a0))
|
|
7
|
+
|
|
8
|
+
### 🩹 Fixes
|
|
9
|
+
|
|
10
|
+
- **general:** Remove build step from tests command ([9d6e02f](https://github.com/miyukiproject/yukigo/commit/9d6e02f))
|
|
11
|
+
- **yukigo-prolog-parser:** Fixed some failed tests ([89d0b09](https://github.com/miyukiproject/yukigo/commit/89d0b09))
|
|
12
|
+
|
|
13
|
+
### 🧱 Updated Dependencies
|
|
14
|
+
|
|
15
|
+
- Updated yukigo-ast to 0.1.0
|
|
16
|
+
|
|
17
|
+
### ❤️ Thank You
|
|
18
|
+
|
|
19
|
+
- noiseArch
|
|
20
|
+
- Valtolina Matias
|
package/dist/index.d.ts
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
export * from "./parser/parser.js";
|
package/dist/index.js
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"./src/","sources":["index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAA"}
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
interface NearleyToken {
|
|
2
|
+
value: any;
|
|
3
|
+
[key: string]: any;
|
|
4
|
+
}
|
|
5
|
+
interface NearleyLexer {
|
|
6
|
+
reset: (chunk: string, info: any) => void;
|
|
7
|
+
next: () => NearleyToken | undefined;
|
|
8
|
+
save: () => any;
|
|
9
|
+
formatError: (token: never) => string;
|
|
10
|
+
has: (tokenType: string) => boolean;
|
|
11
|
+
}
|
|
12
|
+
interface NearleyRule {
|
|
13
|
+
name: string;
|
|
14
|
+
symbols: NearleySymbol[];
|
|
15
|
+
postprocess?: (d: any[], loc?: number, reject?: {}) => any;
|
|
16
|
+
}
|
|
17
|
+
type NearleySymbol = string | {
|
|
18
|
+
literal: any;
|
|
19
|
+
} | {
|
|
20
|
+
test: (token: any) => boolean;
|
|
21
|
+
};
|
|
22
|
+
interface Grammar {
|
|
23
|
+
Lexer: NearleyLexer | undefined;
|
|
24
|
+
ParserRules: NearleyRule[];
|
|
25
|
+
ParserStart: string;
|
|
26
|
+
}
|
|
27
|
+
declare const grammar: Grammar;
|
|
28
|
+
export default grammar;
|
|
@@ -0,0 +1,141 @@
|
|
|
1
|
+
// Generated automatically by nearley, version 2.20.1
|
|
2
|
+
// http://github.com/Hardmath123/nearley
|
|
3
|
+
// Bypasses TS6133. Allow declared but unused functions.
|
|
4
|
+
// @ts-ignore
|
|
5
|
+
function id(d) { return d[0]; }
|
|
6
|
+
import { NumberPrimitive, StringPrimitive, Rule, Fact, Query, ConsExpression, ArithmeticBinaryOperation, ArithmeticUnaryOperation, ComparisonOperation, Exist, Not, Findall, Sequence, If, Call, Forall, SymbolPrimitive, AssignOperation, UnifyOperation, VariablePattern, FunctorPattern, ConsPattern, ListPattern, LiteralPattern, WildcardPattern, TuplePattern } from "@yukigo/ast";
|
|
7
|
+
import { PrologLexer } from "./lexer.js";
|
|
8
|
+
const asSequence = (d) => d.length === 1 ? d[0] : new Sequence(d);
|
|
9
|
+
;
|
|
10
|
+
;
|
|
11
|
+
;
|
|
12
|
+
;
|
|
13
|
+
const grammar = {
|
|
14
|
+
Lexer: PrologLexer,
|
|
15
|
+
ParserRules: [
|
|
16
|
+
{ "name": "program$ebnf$1", "symbols": [] },
|
|
17
|
+
{ "name": "program$ebnf$1$subexpression$1", "symbols": ["clause", "_"] },
|
|
18
|
+
{ "name": "program$ebnf$1", "symbols": ["program$ebnf$1", "program$ebnf$1$subexpression$1"], "postprocess": (d) => d[0].concat([d[1]]) },
|
|
19
|
+
{ "name": "program", "symbols": ["program$ebnf$1"], "postprocess": (d) => d[0].map(x => x[0]).filter(x => x !== null).flat(Infinity) },
|
|
20
|
+
{ "name": "clause$subexpression$1", "symbols": ["fact"] },
|
|
21
|
+
{ "name": "clause$subexpression$1", "symbols": ["rule"] },
|
|
22
|
+
{ "name": "clause$subexpression$1", "symbols": ["query"] },
|
|
23
|
+
{ "name": "clause", "symbols": ["clause$subexpression$1"], "postprocess": (d) => d[0][0] },
|
|
24
|
+
{ "name": "fact$ebnf$1", "symbols": ["arguments"], "postprocess": id },
|
|
25
|
+
{ "name": "fact$ebnf$1", "symbols": [], "postprocess": () => null },
|
|
26
|
+
{ "name": "fact", "symbols": ["any_atom", "fact$ebnf$1", "_", (PrologLexer.has("period") ? { type: "period" } : period)], "postprocess": (d) => new Fact(d[0], d[1] ?? []) },
|
|
27
|
+
{ "name": "rule$ebnf$1", "symbols": ["arguments"], "postprocess": id },
|
|
28
|
+
{ "name": "rule$ebnf$1", "symbols": [], "postprocess": () => null },
|
|
29
|
+
{ "name": "rule", "symbols": ["any_atom", "rule$ebnf$1", "_", (PrologLexer.has("colonDash") ? { type: "colonDash" } : colonDash), "_", "body", "_", (PrologLexer.has("period") ? { type: "period" } : period)], "postprocess": (d) => new Rule(d[0], d[1] ?? [], d[5]) },
|
|
30
|
+
{ "name": "query", "symbols": [(PrologLexer.has("queryOp") ? { type: "queryOp" } : queryOp), "_", "body", "_", (PrologLexer.has("period") ? { type: "period" } : period)], "postprocess": (d) => new Query(d[2]) },
|
|
31
|
+
{ "name": "body$ebnf$1", "symbols": [] },
|
|
32
|
+
{ "name": "body$ebnf$1$subexpression$1$subexpression$1", "symbols": [(PrologLexer.has("comma") ? { type: "comma" } : comma)] },
|
|
33
|
+
{ "name": "body$ebnf$1$subexpression$1$subexpression$1", "symbols": [(PrologLexer.has("semicolon") ? { type: "semicolon" } : semicolon)] },
|
|
34
|
+
{ "name": "body$ebnf$1$subexpression$1", "symbols": ["_", "body$ebnf$1$subexpression$1$subexpression$1", "_", "expression"] },
|
|
35
|
+
{ "name": "body$ebnf$1", "symbols": ["body$ebnf$1", "body$ebnf$1$subexpression$1"], "postprocess": (d) => d[0].concat([d[1]]) },
|
|
36
|
+
{ "name": "body", "symbols": ["expression", "body$ebnf$1"], "postprocess": (d) => [d[0], ...d[1].map(x => x[3])] },
|
|
37
|
+
{ "name": "expression$subexpression$1", "symbols": ["conditional"] },
|
|
38
|
+
{ "name": "expression$subexpression$1", "symbols": ["forall"] },
|
|
39
|
+
{ "name": "expression$subexpression$1", "symbols": ["findall"] },
|
|
40
|
+
{ "name": "expression$subexpression$1", "symbols": ["unification"] },
|
|
41
|
+
{ "name": "expression$subexpression$1", "symbols": ["assignment"] },
|
|
42
|
+
{ "name": "expression$subexpression$1", "symbols": ["comparison"] },
|
|
43
|
+
{ "name": "expression$subexpression$1", "symbols": ["not"] },
|
|
44
|
+
{ "name": "expression$subexpression$1", "symbols": ["exist"] },
|
|
45
|
+
{ "name": "expression", "symbols": ["expression$subexpression$1"], "postprocess": (d) => d[0][0] },
|
|
46
|
+
{ "name": "expression", "symbols": [{ "literal": "(" }, "_", "expression", "_", { "literal": ")" }], "postprocess": (d) => d[2] },
|
|
47
|
+
{ "name": "conditional", "symbols": [{ "literal": "(" }, "_", "body", "_", { "literal": "->" }, "_", "body", "_", (PrologLexer.has("semicolon") ? { type: "semicolon" } : semicolon), "_", "body", "_", { "literal": ")" }], "postprocess": (d) => new If(asSequence(d[2]), asSequence(d[6]), asSequence(d[10]))
|
|
48
|
+
},
|
|
49
|
+
{ "name": "forall", "symbols": [(PrologLexer.has("forallRule") ? { type: "forallRule" } : forallRule), { "literal": "(" }, "_", "expression", "_", (PrologLexer.has("comma") ? { type: "comma" } : comma), "_", "expression", "_", { "literal": ")" }], "postprocess": (d) => new Forall(d[3], d[7]) },
|
|
50
|
+
{ "name": "findall", "symbols": [(PrologLexer.has("findallRule") ? { type: "findallRule" } : findallRule), { "literal": "(" }, "_", "expression", "_", (PrologLexer.has("comma") ? { type: "comma" } : comma), "_", "expression", "_", (PrologLexer.has("comma") ? { type: "comma" } : comma), "_", "expression", "_", { "literal": ")" }], "postprocess": (d) => new Findall(d[3], d[7], d[11]) },
|
|
51
|
+
{ "name": "not", "symbols": [(PrologLexer.has("notOperator") ? { type: "notOperator" } : notOperator), "_", "expression"], "postprocess": (d) => new Not([d[2]]) },
|
|
52
|
+
{ "name": "not", "symbols": [(PrologLexer.has("notOperator") ? { type: "notOperator" } : notOperator), "_", { "literal": "(" }, "_", { "literal": "(" }, "_", "body", "_", { "literal": ")" }, "_", { "literal": ")" }], "postprocess": (d) => new Not([asSequence(d[6])]) },
|
|
53
|
+
{ "name": "exist", "symbols": [{ "literal": "call" }, (PrologLexer.has("lparen") ? { type: "lparen" } : lparen), "_", "pattern_list", "_", (PrologLexer.has("rparen") ? { type: "rparen" } : rparen)], "postprocess": (d) => {
|
|
54
|
+
const [callee, ...rest] = d[3];
|
|
55
|
+
return new Call(callee.name, rest);
|
|
56
|
+
} },
|
|
57
|
+
{ "name": "exist$ebnf$1", "symbols": ["arguments"], "postprocess": id },
|
|
58
|
+
{ "name": "exist$ebnf$1", "symbols": [], "postprocess": () => null },
|
|
59
|
+
{ "name": "exist", "symbols": ["any_atom", "exist$ebnf$1"], "postprocess": (d, l, reject) => {
|
|
60
|
+
const val = d[0].value;
|
|
61
|
+
if (val === "not" || val === "\\+")
|
|
62
|
+
return reject;
|
|
63
|
+
return new Exist(d[0], d[1] ?? []);
|
|
64
|
+
} },
|
|
65
|
+
{ "name": "exist", "symbols": ["variable"], "postprocess": (d) => new Exist(d[0], []) },
|
|
66
|
+
{ "name": "assignment", "symbols": ["addition", "_", { "literal": "is" }, "_", "addition"], "postprocess": (d) => new AssignOperation("Assign", d[0], d[4]) },
|
|
67
|
+
{ "name": "unification", "symbols": ["addition", "_", { "literal": "=" }, "_", "addition"], "postprocess": (d) => new UnifyOperation("Unify", d[0], d[4]) },
|
|
68
|
+
{ "name": "comparison", "symbols": ["addition", "_", "comparison_op", "_", "addition"], "postprocess": (d) => new ComparisonOperation(d[2], d[0], d[4]) },
|
|
69
|
+
{ "name": "addition", "symbols": ["multiplication", "_", { "literal": "+" }, "_", "addition"], "postprocess": (d) => new ArithmeticBinaryOperation("Plus", d[0], d[4]) },
|
|
70
|
+
{ "name": "addition", "symbols": ["multiplication", "_", { "literal": "-" }, "_", "addition"], "postprocess": (d) => new ArithmeticBinaryOperation("Minus", d[0], d[4]) },
|
|
71
|
+
{ "name": "addition", "symbols": ["multiplication"], "postprocess": id },
|
|
72
|
+
{ "name": "multiplication", "symbols": ["primary", "_", { "literal": "*" }, "_", "multiplication"], "postprocess": (d) => new ArithmeticBinaryOperation("Multiply", d[0], d[4]) },
|
|
73
|
+
{ "name": "multiplication", "symbols": ["primary", "_", { "literal": "/" }, "_", "multiplication"], "postprocess": (d) => new ArithmeticBinaryOperation("Divide", d[0], d[4]) },
|
|
74
|
+
{ "name": "multiplication", "symbols": ["primary"], "postprocess": id },
|
|
75
|
+
{ "name": "primary", "symbols": ["arithmetic_literal"], "postprocess": id },
|
|
76
|
+
{ "name": "primary", "symbols": ["variable"], "postprocess": id },
|
|
77
|
+
{ "name": "primary", "symbols": ["strict_atom", "arguments"], "postprocess": d => new Exist(d[0], d[1] ?? []) },
|
|
78
|
+
{ "name": "primary", "symbols": ["primitiveOperation"], "postprocess": id },
|
|
79
|
+
{ "name": "primary", "symbols": ["cons_expr"], "postprocess": id },
|
|
80
|
+
{ "name": "primary", "symbols": [{ "literal": "(" }, "_", "addition", "_", { "literal": ")" }], "postprocess": d => d[2] },
|
|
81
|
+
{ "name": "cons_expr", "symbols": [{ "literal": "[" }, "_", "primary_list", "_", (PrologLexer.has("consOp") ? { type: "consOp" } : consOp), "_", "expression", "_", { "literal": "]" }], "postprocess": (d) => new ConsExpression(d[2], d[6]) },
|
|
82
|
+
{ "name": "primitiveOperation", "symbols": [{ "literal": "round" }, "__", "addition"], "postprocess": d => new ArithmeticUnaryOperation("Round", d[2]) },
|
|
83
|
+
{ "name": "primitiveOperation", "symbols": [{ "literal": "abs" }, "__", "addition"], "postprocess": d => new ArithmeticUnaryOperation("Absolute", d[2]) },
|
|
84
|
+
{ "name": "primitiveOperation", "symbols": [{ "literal": "sqrt" }, "__", "addition"], "postprocess": d => new ArithmeticUnaryOperation("Sqrt", d[2]) },
|
|
85
|
+
{ "name": "primitiveArguments", "symbols": [(PrologLexer.has("lparen") ? { type: "lparen" } : lparen), "_", "primary_list", "_", (PrologLexer.has("rparen") ? { type: "rparen" } : rparen)], "postprocess": (d) => d[2] },
|
|
86
|
+
{ "name": "primary_list$ebnf$1", "symbols": [] },
|
|
87
|
+
{ "name": "primary_list$ebnf$1$subexpression$1", "symbols": ["_", (PrologLexer.has("comma") ? { type: "comma" } : comma), "_", "addition"] },
|
|
88
|
+
{ "name": "primary_list$ebnf$1", "symbols": ["primary_list$ebnf$1", "primary_list$ebnf$1$subexpression$1"], "postprocess": (d) => d[0].concat([d[1]]) },
|
|
89
|
+
{ "name": "primary_list", "symbols": ["addition", "primary_list$ebnf$1"], "postprocess": (d) => [d[0], ...d[1].map(x => x[3])] },
|
|
90
|
+
{ "name": "arguments", "symbols": [(PrologLexer.has("lparen") ? { type: "lparen" } : lparen), "_", "pattern_list", "_", (PrologLexer.has("rparen") ? { type: "rparen" } : rparen)], "postprocess": (d) => d[2] },
|
|
91
|
+
{ "name": "pattern_list$ebnf$1", "symbols": [] },
|
|
92
|
+
{ "name": "pattern_list$ebnf$1$subexpression$1", "symbols": ["_", (PrologLexer.has("comma") ? { type: "comma" } : comma), "_", "pattern"] },
|
|
93
|
+
{ "name": "pattern_list$ebnf$1", "symbols": ["pattern_list$ebnf$1", "pattern_list$ebnf$1$subexpression$1"], "postprocess": (d) => d[0].concat([d[1]]) },
|
|
94
|
+
{ "name": "pattern_list", "symbols": ["pattern", "pattern_list$ebnf$1"], "postprocess": (d) => [d[0], ...d[1].map(x => x[3])] },
|
|
95
|
+
{ "name": "pattern", "symbols": ["variable"], "postprocess": (d) => new VariablePattern(d[0]) },
|
|
96
|
+
{ "name": "pattern", "symbols": ["structural_literal"], "postprocess": (d) => new LiteralPattern(d[0]) },
|
|
97
|
+
{ "name": "pattern", "symbols": [(PrologLexer.has("wildcard") ? { type: "wildcard" } : wildcard)], "postprocess": (d) => new WildcardPattern() },
|
|
98
|
+
{ "name": "pattern", "symbols": ["any_atom", "arguments"], "postprocess": (d) => new FunctorPattern(d[0], d[1]) },
|
|
99
|
+
{ "name": "pattern", "symbols": [{ "literal": "(" }, "_", "pattern_list", "_", { "literal": ")" }], "postprocess": (d) => new TuplePattern(d[2]) },
|
|
100
|
+
{ "name": "pattern", "symbols": [{ "literal": "[" }, "_", "pattern_list", "_", (PrologLexer.has("consOp") ? { type: "consOp" } : consOp), "_", "pattern", "_", { "literal": "]" }], "postprocess": (d) => new ConsPattern(d[2].length > 1 ? new ListPattern(d[2]) : d[2][0], new VariablePattern(d[6])) },
|
|
101
|
+
{ "name": "pattern$ebnf$1", "symbols": ["pattern_list"], "postprocess": id },
|
|
102
|
+
{ "name": "pattern$ebnf$1", "symbols": [], "postprocess": () => null },
|
|
103
|
+
{ "name": "pattern", "symbols": [{ "literal": "[" }, "_", "pattern$ebnf$1", "_", { "literal": "]" }], "postprocess": (d) => new ListPattern(d[2] ? d[2] : []) },
|
|
104
|
+
{ "name": "variable", "symbols": [(PrologLexer.has("variable") ? { type: "variable" } : variable)], "postprocess": (d) => new SymbolPrimitive(d[0].value) },
|
|
105
|
+
{ "name": "strict_atom", "symbols": [(PrologLexer.has("atom") ? { type: "atom" } : atom)], "postprocess": (d) => new SymbolPrimitive(d[0].value) },
|
|
106
|
+
{ "name": "any_atom$subexpression$1", "symbols": [(PrologLexer.has("atom") ? { type: "atom" } : atom)] },
|
|
107
|
+
{ "name": "any_atom$subexpression$1", "symbols": [(PrologLexer.has("op") ? { type: "op" } : op)] },
|
|
108
|
+
{ "name": "any_atom$subexpression$1", "symbols": [(PrologLexer.has("comparisonOp") ? { type: "comparisonOp" } : comparisonOp)] },
|
|
109
|
+
{ "name": "any_atom", "symbols": ["any_atom$subexpression$1"], "postprocess": (d) => new SymbolPrimitive(d[0][0].value) },
|
|
110
|
+
{ "name": "arithmetic_literal", "symbols": ["strict_atom"], "postprocess": id },
|
|
111
|
+
{ "name": "arithmetic_literal", "symbols": [(PrologLexer.has("number") ? { type: "number" } : number)], "postprocess": (d) => new NumberPrimitive(Number(d[0].value)) },
|
|
112
|
+
{ "name": "arithmetic_literal", "symbols": [(PrologLexer.has("string") ? { type: "string" } : string)], "postprocess": (d) => new StringPrimitive(d[0].value) },
|
|
113
|
+
{ "name": "structural_literal", "symbols": ["any_atom"], "postprocess": id },
|
|
114
|
+
{ "name": "structural_literal", "symbols": [(PrologLexer.has("number") ? { type: "number" } : number)], "postprocess": (d) => new NumberPrimitive(Number(d[0].value)) },
|
|
115
|
+
{ "name": "structural_literal", "symbols": [(PrologLexer.has("string") ? { type: "string" } : string)], "postprocess": (d) => new StringPrimitive(d[0].value) },
|
|
116
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "=:=" }], "postprocess": d => "Equal" },
|
|
117
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "=\\=" }], "postprocess": d => "NotEqual" },
|
|
118
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "==" }], "postprocess": d => "Same" },
|
|
119
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "\\==" }], "postprocess": d => "NotSame" },
|
|
120
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "\\=" }], "postprocess": d => "NotSame" },
|
|
121
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "@<" }], "postprocess": d => "LessThan" },
|
|
122
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "@=<" }], "postprocess": d => "LessOrEqualThan" },
|
|
123
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "@>" }], "postprocess": d => "GreaterThan" },
|
|
124
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "@>=" }], "postprocess": d => "GreaterOrEqualThan" },
|
|
125
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "<" }], "postprocess": d => "LessThan" },
|
|
126
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "=<" }], "postprocess": d => "LessOrEqualThan" },
|
|
127
|
+
{ "name": "comparison_op", "symbols": [{ "literal": ">" }], "postprocess": d => "GreaterThan" },
|
|
128
|
+
{ "name": "comparison_op", "symbols": [{ "literal": ">=" }], "postprocess": d => "GreaterOrEqualThan" },
|
|
129
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "=@=" }], "postprocess": d => "Same" },
|
|
130
|
+
{ "name": "comparison_op", "symbols": [{ "literal": "\\=@=" }], "postprocess": d => "NotSame" },
|
|
131
|
+
{ "name": "_$ebnf$1", "symbols": [] },
|
|
132
|
+
{ "name": "_$ebnf$1", "symbols": ["_$ebnf$1", (PrologLexer.has("WS") ? { type: "WS" } : WS)], "postprocess": (d) => d[0].concat([d[1]]) },
|
|
133
|
+
{ "name": "_", "symbols": ["_$ebnf$1"] },
|
|
134
|
+
{ "name": "__$ebnf$1", "symbols": [(PrologLexer.has("WS") ? { type: "WS" } : WS)], "postprocess": id },
|
|
135
|
+
{ "name": "__$ebnf$1", "symbols": [], "postprocess": () => null },
|
|
136
|
+
{ "name": "__", "symbols": ["__$ebnf$1"] }
|
|
137
|
+
],
|
|
138
|
+
ParserStart: "program",
|
|
139
|
+
};
|
|
140
|
+
export default grammar;
|
|
141
|
+
//# sourceMappingURL=grammar.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"grammar.js","sourceRoot":"./src/","sources":["parser/grammar.ts"],"names":[],"mappings":"AAAA,qDAAqD;AACrD,wCAAwC;AACxC,wDAAwD;AACxD,aAAa;AACb,SAAS,EAAE,CAAC,CAAQ,IAAS,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAqB3C,OAAO,EACH,eAAe,EACf,eAAe,EACf,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,cAAc,EACd,yBAAyB,EACzB,wBAAwB,EACxB,mBAAmB,EACnB,KAAK,EACL,GAAG,EACH,OAAO,EACP,QAAQ,EACR,EAAE,EACF,IAAI,EACJ,MAAM,EACN,eAAe,EACf,eAAe,EACf,cAAc,EACd,eAAe,EACf,cAAc,EACd,WAAW,EACX,WAAW,EACX,cAAc,EACd,eAAe,EACf,YAAY,EACd,MAAM,aAAa,CAAA;AAErB,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AAExC,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;AAMjE,CAAC;AAQD,CAAC;AAMD,CAAC;AAQD,CAAC;AAEF,MAAM,OAAO,GAAY;IACvB,KAAK,EAAE,WAAW;IAClB,WAAW,EAAE;QACX,EAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,EAAE,EAAE,EAAC;QACzC,EAAC,MAAM,EAAE,gCAAgC,EAAE,SAAS,EAAE,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAC;QACtE,EAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC,gBAAgB,EAAE,gCAAgC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACtI,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,gBAAgB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAC;QACpI,EAAC,MAAM,EAAE,wBAAwB,EAAE,SAAS,EAAE,CAAC,MAAM,CAAC,EAAC;QACvD,EAAC,MAAM,EAAE,wBAAwB,EAAE,SAAS,EAAE,CAAC,MAAM,CAAC,EAAC;QACvD,EAAC,MAAM,EAAE,wBAAwB,EAAE,SAAS,EAAE,CAAC,OAAO,CAAC,EAAC;QACxD,EAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,wBAAwB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACxF,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,WAAW,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QACpE,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,EAAC;QACjE,EAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAC;QACxK,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,WAAW,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QACpE,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,EAAC;QACjE,EAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,WAAW,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAClQ,EAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,SAAS,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC5M,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,EAAE,EAAC;QACtC,EAAC,MAAM,EAAE,6CAA6C,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,OAAO,EAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAC;QAC1H,EAAC,MAAM,EAAE,6CAA6C,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,WAAW,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAC;QACtI,EAAC,MAAM,EAAE,6BAA6B,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,6CAA6C,EAAE,GAAG,EAAE,YAAY,CAAC,EAAC;QAC3H,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,aAAa,EAAE,6BAA6B,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC7H,EAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,YAAY,EAAE,aAAa,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAChH,EAAC,MAAM,EAAE,4BAA4B,EAAE,SAAS,EAAE,CAAC,aAAa,CAAC,EAAC;QAClE,EAAC,MAAM,EAAE,4BAA4B,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,EAAC;QAC7D,EAAC,MAAM,EAAE,4BAA4B,EAAE,SAAS,EAAE,CAAC,SAAS,CAAC,EAAC;QAC9D,EAAC,MAAM,EAAE,4BAA4B,EAAE,SAAS,EAAE,CAAC,aAAa,CAAC,EAAC;QAClE,EAAC,MAAM,EAAE,4BAA4B,EAAE,SAAS,EAAE,CAAC,YAAY,CAAC,EAAC;QACjE,EAAC,MAAM,EAAE,4BAA4B,EAAE,SAAS,EAAE,CAAC,YAAY,CAAC,EAAC;QACjE,EAAC,MAAM,EAAE,4BAA4B,EAAE,SAAS,EAAE,CAAC,KAAK,CAAC,EAAC;QAC1D,EAAC,MAAM,EAAE,4BAA4B,EAAE,SAAS,EAAE,CAAC,OAAO,CAAC,EAAC;QAC5D,EAAC,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,4BAA4B,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAChG,EAAC,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACzH,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,IAAI,EAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,WAAW,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAG,CAAC,CAAC,EAAE,EAAE,CACnO,IAAI,EAAE,CACF,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAChB,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAChB,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CACpB;SACA;QACL,EAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,YAAY,EAAC,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,OAAO,EAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC1R,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,aAAa,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,OAAO,EAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,OAAO,EAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC;QACpX,EAAC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,aAAa,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC9J,EAAC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,aAAa,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC5P,EAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,MAAM,EAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAG,CAAC,CAAC,EAAE,EAAE;gBAC7M,MAAM,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC9B,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACtC,CAAC,EAAE;QACP,EAAC,MAAM,EAAE,cAAc,EAAE,SAAS,EAAE,CAAC,WAAW,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QACrE,EAAC,MAAM,EAAE,cAAc,EAAE,SAAS,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,EAAC;QAClE,EAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,cAAc,CAAC,EAAE,aAAa,EAAG,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE;gBACpF,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvB,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK;oBAAE,OAAO,MAAM,CAAC;gBAClD,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;YACtC,CAAC,EAAE;QACP,EAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAC;QACrF,EAAC,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,IAAI,EAAC,EAAE,GAAG,EAAE,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACxJ,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACtJ,EAAC,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACvJ,EAAC,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,yBAAyB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACnK,EAAC,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,yBAAyB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACpK,EAAC,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,gBAAgB,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QACtE,EAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,gBAAgB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,yBAAyB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC5K,EAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,gBAAgB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,yBAAyB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC1K,EAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC,SAAS,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QACrE,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,oBAAoB,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QACzE,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QAC/D,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,aAAa,EAAE,WAAW,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAC;QAC7G,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,oBAAoB,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QACzE,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,WAAW,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QAChE,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAClH,EAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACrO,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,OAAO,EAAC,EAAE,IAAI,EAAE,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,wBAAwB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACnJ,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,KAAK,EAAC,EAAE,IAAI,EAAE,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,wBAAwB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACpJ,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,MAAM,EAAC,EAAE,IAAI,EAAE,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,wBAAwB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACjJ,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACnN,EAAC,MAAM,EAAE,qBAAqB,EAAE,SAAS,EAAE,EAAE,EAAC;QAC9C,EAAC,MAAM,EAAE,qCAAqC,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,OAAO,EAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,EAAC;QACxI,EAAC,MAAM,EAAE,qBAAqB,EAAE,SAAS,EAAE,CAAC,qBAAqB,EAAE,qCAAqC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACrJ,EAAC,MAAM,EAAE,cAAc,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,qBAAqB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC9H,EAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC1M,EAAC,MAAM,EAAE,qBAAqB,EAAE,SAAS,EAAE,EAAE,EAAC;QAC9C,EAAC,MAAM,EAAE,qCAAqC,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,OAAO,EAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,EAAC;QACvI,EAAC,MAAM,EAAE,qBAAqB,EAAE,SAAS,EAAE,CAAC,qBAAqB,EAAE,qCAAqC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACrJ,EAAC,MAAM,EAAE,cAAc,EAAE,SAAS,EAAE,CAAC,SAAS,EAAE,qBAAqB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC7H,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC7F,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,oBAAoB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACtG,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,UAAU,EAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,EAAE,EAAC;QAC5I,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,WAAW,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC/G,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC1I,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QAC/R,EAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC,cAAc,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QAC1E,EAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,EAAC;QACpE,EAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,EAAE,GAAG,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAC;QACvJ,EAAC,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,UAAU,EAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAC;QACvJ,EAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,MAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAC;QAC9I,EAAC,MAAM,EAAE,0BAA0B,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,MAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAC;QACpG,EAAC,MAAM,EAAE,0BAA0B,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC;QAC9F,EAAC,MAAM,EAAE,0BAA0B,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,cAAc,EAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,EAAC;QAC5H,EAAC,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,0BAA0B,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAC;QACvH,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,aAAa,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QAC7E,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAC;QACnK,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAC;QAC3J,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QAC1E,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAC;QACnK,EAAC,MAAM,EAAE,oBAAoB,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAC;QAC3J,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,KAAK,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAC;QACtF,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,MAAM,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,UAAU,EAAC;QAC1F,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,IAAI,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,EAAC;QACpF,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,MAAM,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,EAAC;QACzF,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,KAAK,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,EAAC;QACxF,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,IAAI,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,UAAU,EAAC;QACxF,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,KAAK,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,iBAAiB,EAAC;QAChG,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,IAAI,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,aAAa,EAAC;QAC3F,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,KAAK,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,oBAAoB,EAAC;QACnG,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,UAAU,EAAC;QACvF,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,IAAI,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,iBAAiB,EAAC;QAC/F,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,GAAG,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,aAAa,EAAC;QAC1F,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,IAAI,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,oBAAoB,EAAC;QAClG,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,KAAK,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,EAAC;QACrF,EAAC,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,CAAC,EAAC,SAAS,EAAC,OAAO,EAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,EAAC;QAC1F,EAAC,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,EAAE,EAAC;QACnC,EAAC,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,UAAU,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;QACrI,EAAC,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,EAAC;QACtC,EAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAC,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,EAAE,EAAE,EAAC;QAClG,EAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,EAAC;QAC/D,EAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,WAAW,CAAC,EAAC;KACzC;IACD,WAAW,EAAE,SAAS;CACvB,CAAC;AAEF,eAAe,OAAO,CAAC"}
|
|
@@ -0,0 +1,39 @@
|
|
|
1
|
+
import moo from "moo";
|
|
2
|
+
export declare const PrologLexerConfig: {
|
|
3
|
+
WS: RegExp;
|
|
4
|
+
wildcard: string;
|
|
5
|
+
notOperator: {
|
|
6
|
+
match: string[];
|
|
7
|
+
};
|
|
8
|
+
forallRule: string;
|
|
9
|
+
findallRule: string;
|
|
10
|
+
comment: RegExp;
|
|
11
|
+
number: RegExp;
|
|
12
|
+
string: RegExp;
|
|
13
|
+
backtick: string;
|
|
14
|
+
lparen: string;
|
|
15
|
+
rparen: string;
|
|
16
|
+
lbracket: string;
|
|
17
|
+
rbracket: string;
|
|
18
|
+
lsquare: string;
|
|
19
|
+
rsquare: string;
|
|
20
|
+
comma: string;
|
|
21
|
+
arrow: string;
|
|
22
|
+
period: string;
|
|
23
|
+
semicolon: string;
|
|
24
|
+
colonDash: string;
|
|
25
|
+
consOp: string;
|
|
26
|
+
queryOp: string;
|
|
27
|
+
comparisonOp: RegExp;
|
|
28
|
+
op: RegExp;
|
|
29
|
+
variable: RegExp;
|
|
30
|
+
atom: {
|
|
31
|
+
match: RegExp;
|
|
32
|
+
type: moo.TypeMapper;
|
|
33
|
+
};
|
|
34
|
+
NL: {
|
|
35
|
+
match: RegExp;
|
|
36
|
+
lineBreaks: boolean;
|
|
37
|
+
};
|
|
38
|
+
};
|
|
39
|
+
export declare const PrologLexer: any;
|
|
@@ -0,0 +1,38 @@
|
|
|
1
|
+
import { makeLexer } from "moo-ignore";
|
|
2
|
+
import moo from "moo";
|
|
3
|
+
export const PrologLexerConfig = {
|
|
4
|
+
WS: /[ \t]+/,
|
|
5
|
+
wildcard: "_",
|
|
6
|
+
notOperator: { match: ["\\+", "not"] },
|
|
7
|
+
forallRule: "forall",
|
|
8
|
+
findallRule: "findall",
|
|
9
|
+
comment: /%.*|\/\*[\s\S]*?\*\//,
|
|
10
|
+
number: /-?\b(?:[0-9]+(?:\.[0-9]+(?:e[+-]?[0-9]+)?)?|0o[0-7]+|0x[0-9a-fA-F]+|0b[01]+)\b/,
|
|
11
|
+
string: /(?:'(?:[^']|'')*')/,
|
|
12
|
+
backtick: "`",
|
|
13
|
+
lparen: "(",
|
|
14
|
+
rparen: ")",
|
|
15
|
+
lbracket: "{",
|
|
16
|
+
rbracket: "}",
|
|
17
|
+
lsquare: "[",
|
|
18
|
+
rsquare: "]",
|
|
19
|
+
comma: ",",
|
|
20
|
+
arrow: "->",
|
|
21
|
+
period: ".",
|
|
22
|
+
semicolon: ";",
|
|
23
|
+
colonDash: ":-",
|
|
24
|
+
consOp: "|",
|
|
25
|
+
queryOp: "?-",
|
|
26
|
+
comparisonOp: /@<|@=<|@>=|@>|<|=<|>=|>|=@=|\\=@=|=:=|=\\=|==|\\==|\\=|=/,
|
|
27
|
+
op: /\+|-|\*|\/|\/\/|~|\^|\?|\$|''|\.\./,
|
|
28
|
+
variable: /[A-Z][a-zA-Z0-9_]*/,
|
|
29
|
+
atom: {
|
|
30
|
+
match: /[a-z!][a-zA-Z0-9_]*/,
|
|
31
|
+
type: moo.keywords({
|
|
32
|
+
primitiveOperator: ["round", "abs", "sqrt", "call"],
|
|
33
|
+
}),
|
|
34
|
+
},
|
|
35
|
+
NL: { match: /\r?\n/, lineBreaks: true },
|
|
36
|
+
};
|
|
37
|
+
export const PrologLexer = makeLexer(PrologLexerConfig, ["comment", "NL"]);
|
|
38
|
+
//# sourceMappingURL=lexer.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"lexer.js","sourceRoot":"./src/","sources":["parser/lexer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AACvC,OAAO,GAAG,MAAM,KAAK,CAAC;AACtB,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,EAAE,EAAE,QAAQ;IACZ,QAAQ,EAAE,GAAG;IACb,WAAW,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;IACtC,UAAU,EAAE,QAAQ;IACpB,WAAW,EAAE,SAAS;IACtB,OAAO,EAAE,sBAAsB;IAC/B,MAAM,EACJ,gFAAgF;IAClF,MAAM,EAAE,oBAAoB;IAC5B,QAAQ,EAAE,GAAG;IACb,MAAM,EAAE,GAAG;IACX,MAAM,EAAE,GAAG;IACX,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,GAAG;IACb,OAAO,EAAE,GAAG;IACZ,OAAO,EAAE,GAAG;IACZ,KAAK,EAAE,GAAG;IACV,KAAK,EAAE,IAAI;IACX,MAAM,EAAE,GAAG;IACX,SAAS,EAAE,GAAG;IACd,SAAS,EAAE,IAAI;IACf,MAAM,EAAE,GAAG;IACX,OAAO,EAAE,IAAI;IACb,YAAY,EAAE,0DAA0D;IACxE,EAAE,EAAE,oCAAoC;IACxC,QAAQ,EAAE,oBAAoB;IAC9B,IAAI,EAAE;QACJ,KAAK,EAAE,qBAAqB;QAC5B,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC;YACjB,iBAAiB,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC;SACpD,CAAC;KACH;IACD,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE;CACzC,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAG,SAAS,CAAC,iBAAiB,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1,31 @@
|
|
|
1
|
+
import nearley from "nearley";
|
|
2
|
+
import grammar from "./grammar.js";
|
|
3
|
+
export class YukigoPrologParser {
|
|
4
|
+
errors = [];
|
|
5
|
+
parse(code) {
|
|
6
|
+
const parser = new nearley.Parser(nearley.Grammar.fromCompiled(grammar));
|
|
7
|
+
try {
|
|
8
|
+
parser.feed(code);
|
|
9
|
+
parser.finish();
|
|
10
|
+
}
|
|
11
|
+
catch (error) {
|
|
12
|
+
console.log(error);
|
|
13
|
+
if ("token" in error)
|
|
14
|
+
throw Error(error);
|
|
15
|
+
const token = error.token;
|
|
16
|
+
const message = `Unexpected '${token.type}' token '${token.value}' at line ${token.line} col ${token.col}.`;
|
|
17
|
+
this.errors.push(message);
|
|
18
|
+
throw Error(message);
|
|
19
|
+
}
|
|
20
|
+
if (parser.results.length > 1) {
|
|
21
|
+
this.errors.push(`Too much ambiguity. ${parser.results.length} ASTs. Output not generated.`);
|
|
22
|
+
throw Error(`Too much ambiguity. ${parser.results.length} ASTs. Output not generated.`);
|
|
23
|
+
}
|
|
24
|
+
if (parser.results.length == 0) {
|
|
25
|
+
this.errors.push("Parser did not generate an AST.");
|
|
26
|
+
throw Error("Parser did not generate an AST.");
|
|
27
|
+
}
|
|
28
|
+
return parser.results[0];
|
|
29
|
+
}
|
|
30
|
+
}
|
|
31
|
+
//# sourceMappingURL=parser.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"parser.js","sourceRoot":"./src/","sources":["parser/parser.ts"],"names":[],"mappings":"AACA,OAAO,OAAO,MAAM,SAAS,CAAC;AAC9B,OAAO,OAAO,MAAM,cAAc,CAAC;AAEnC,MAAM,OAAO,kBAAkB;IACtB,MAAM,GAAa,EAAE,CAAC;IACtB,KAAK,CAAC,IAAY;QACvB,MAAM,MAAM,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;QACzE,IAAI,CAAC;YACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,MAAM,CAAC,MAAM,EAAE,CAAC;QAClB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAClB,IAAI,OAAO,IAAI,KAAK;gBAAE,MAAM,KAAK,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YAC1B,MAAM,OAAO,GAAG,eAAe,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,KAAK,aAAa,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,GAAG,GAAG,CAAC;YAC5G,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1B,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CACd,uBAAuB,MAAM,CAAC,OAAO,CAAC,MAAM,8BAA8B,CAC3E,CAAC;YACF,MAAM,KAAK,CACT,uBAAuB,MAAM,CAAC,OAAO,CAAC,MAAM,8BAA8B,CAC3E,CAAC;QACJ,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;YACpD,MAAM,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACjD,CAAC;QAED,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;CACF"}
|
package/package.json
ADDED
|
@@ -0,0 +1,31 @@
|
|
|
1
|
+
{
|
|
2
|
+
"name": "yukigo-prolog-parser",
|
|
3
|
+
"version": "0.1.0",
|
|
4
|
+
"description": "",
|
|
5
|
+
"type": "module",
|
|
6
|
+
"main": "dist/index.js",
|
|
7
|
+
"types": "dist/index.d.ts",
|
|
8
|
+
"scripts": {
|
|
9
|
+
"build": "nearleyc ./src/parser/grammar.ne -o ./src/parser/grammar.ts && tsc",
|
|
10
|
+
"test": "mocha --import=tsx"
|
|
11
|
+
},
|
|
12
|
+
"keywords": [],
|
|
13
|
+
"author": "noiseArch",
|
|
14
|
+
"license": "ISC",
|
|
15
|
+
"dependencies": {
|
|
16
|
+
"moo": "^0.5.2",
|
|
17
|
+
"moo-ignore": "^2.5.3",
|
|
18
|
+
"nearley": "^2.20.1",
|
|
19
|
+
"yukigo-ast": "0.1.0"
|
|
20
|
+
},
|
|
21
|
+
"devDependencies": {
|
|
22
|
+
"@types/chai": "^5.2.2",
|
|
23
|
+
"@types/mocha": "^10.0.10",
|
|
24
|
+
"@types/moo": "^0.5.10",
|
|
25
|
+
"@types/node": "^24.10.0",
|
|
26
|
+
"chai": "^6.2.0",
|
|
27
|
+
"mocha": "^11.7.1",
|
|
28
|
+
"tsx": "^4.20.6",
|
|
29
|
+
"typescript": "^5.9.2"
|
|
30
|
+
}
|
|
31
|
+
}
|
package/src/index.ts
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
export * from "./parser/parser.js"
|
|
@@ -0,0 +1,166 @@
|
|
|
1
|
+
@{%
|
|
2
|
+
import {
|
|
3
|
+
NumberPrimitive,
|
|
4
|
+
StringPrimitive,
|
|
5
|
+
Rule,
|
|
6
|
+
Fact,
|
|
7
|
+
Query,
|
|
8
|
+
ConsExpression,
|
|
9
|
+
ArithmeticBinaryOperation,
|
|
10
|
+
ArithmeticUnaryOperation,
|
|
11
|
+
ComparisonOperation,
|
|
12
|
+
Exist,
|
|
13
|
+
Not,
|
|
14
|
+
Findall,
|
|
15
|
+
Sequence,
|
|
16
|
+
If,
|
|
17
|
+
Call,
|
|
18
|
+
Forall,
|
|
19
|
+
SymbolPrimitive,
|
|
20
|
+
AssignOperation,
|
|
21
|
+
UnifyOperation,
|
|
22
|
+
VariablePattern,
|
|
23
|
+
FunctorPattern,
|
|
24
|
+
ConsPattern,
|
|
25
|
+
ListPattern,
|
|
26
|
+
LiteralPattern,
|
|
27
|
+
WildcardPattern,
|
|
28
|
+
TuplePattern
|
|
29
|
+
} from "yukigo-ast"
|
|
30
|
+
|
|
31
|
+
import { PrologLexer } from "./lexer.js"
|
|
32
|
+
|
|
33
|
+
const asSequence = (d) => d.length === 1 ? d[0] : new Sequence(d);
|
|
34
|
+
|
|
35
|
+
%}
|
|
36
|
+
@preprocessor typescript
|
|
37
|
+
@lexer PrologLexer
|
|
38
|
+
|
|
39
|
+
program -> (clause _):* {% (d) => d[0].map(x => x[0]).filter(x => x !== null).flat(Infinity) %}
|
|
40
|
+
|
|
41
|
+
clause -> (fact | rule | query) {% (d) => d[0][0] %}
|
|
42
|
+
|
|
43
|
+
fact -> any_atom arguments:? _ %period {% (d) => new Fact(d[0], d[1] ?? []) %}
|
|
44
|
+
|
|
45
|
+
rule -> any_atom arguments:? _ %colonDash _ body _ %period {% (d) => new Rule(d[0], d[1] ?? [], d[5]) %}
|
|
46
|
+
|
|
47
|
+
query -> %queryOp _ body _ %period {% (d) => new Query(d[2]) %}
|
|
48
|
+
|
|
49
|
+
body -> expression (_ (%comma | %semicolon) _ expression):* {% (d) => [d[0], ...d[1].map(x => x[3])] %}
|
|
50
|
+
|
|
51
|
+
expression ->
|
|
52
|
+
(conditional | forall | findall | unification | assignment | comparison | not | exist) {% (d) => d[0][0] %}
|
|
53
|
+
| "(" _ expression _ ")" {% (d) => d[2] %}
|
|
54
|
+
|
|
55
|
+
conditional -> "(" _ body _ "->" _ body _ %semicolon _ body _ ")" {% (d) =>
|
|
56
|
+
new If(
|
|
57
|
+
asSequence(d[2]),
|
|
58
|
+
asSequence(d[6]),
|
|
59
|
+
asSequence(d[10])
|
|
60
|
+
)
|
|
61
|
+
%}
|
|
62
|
+
|
|
63
|
+
forall -> %forallRule "(" _ expression _ %comma _ expression _ ")" {% (d) => new Forall(d[3], d[7]) %}
|
|
64
|
+
|
|
65
|
+
findall -> %findallRule "(" _ expression _ %comma _ expression _ %comma _ expression _ ")" {% (d) => new Findall(d[3], d[7], d[11]) %}
|
|
66
|
+
|
|
67
|
+
not ->
|
|
68
|
+
%notOperator _ expression {% (d) => new Not([d[2]]) %}
|
|
69
|
+
| %notOperator _ "(" _ "(" _ body _ ")" _ ")" {% (d) => new Not([asSequence(d[6])]) %}
|
|
70
|
+
|
|
71
|
+
exist ->
|
|
72
|
+
"call" %lparen _ pattern_list _ %rparen {% (d) => {
|
|
73
|
+
const [callee, ...rest] = d[3]
|
|
74
|
+
return new Call(callee.name, rest)
|
|
75
|
+
} %}
|
|
76
|
+
| any_atom arguments:? {% (d, l, reject) => {
|
|
77
|
+
const val = d[0].value;
|
|
78
|
+
if (val === "not" || val === "\\+") return reject;
|
|
79
|
+
return new Exist(d[0], d[1] ?? [])
|
|
80
|
+
} %}
|
|
81
|
+
| variable {% (d) => new Exist(d[0], []) %}
|
|
82
|
+
|
|
83
|
+
|
|
84
|
+
assignment -> addition _ "is" _ addition {% (d) => new AssignOperation("Assign", d[0], d[4]) %}
|
|
85
|
+
|
|
86
|
+
unification -> addition _ "=" _ addition {% (d) => new UnifyOperation("Unify", d[0], d[4]) %}
|
|
87
|
+
|
|
88
|
+
comparison ->
|
|
89
|
+
addition _ comparison_op _ addition {% (d) => new ComparisonOperation(d[2], d[0], d[4]) %}
|
|
90
|
+
|
|
91
|
+
addition ->
|
|
92
|
+
multiplication _ "+" _ addition {% (d) => new ArithmeticBinaryOperation("Plus", d[0], d[4]) %}
|
|
93
|
+
| multiplication _ "-" _ addition {% (d) => new ArithmeticBinaryOperation("Minus", d[0], d[4]) %}
|
|
94
|
+
| multiplication {% id %}
|
|
95
|
+
|
|
96
|
+
multiplication ->
|
|
97
|
+
primary _ "*" _ multiplication {% (d) => new ArithmeticBinaryOperation("Multiply", d[0], d[4]) %}
|
|
98
|
+
| primary _ "/" _ multiplication {% (d) => new ArithmeticBinaryOperation("Divide", d[0], d[4]) %}
|
|
99
|
+
| primary {% id %}
|
|
100
|
+
|
|
101
|
+
primary ->
|
|
102
|
+
arithmetic_literal {% id %}
|
|
103
|
+
| variable {% id %}
|
|
104
|
+
| strict_atom arguments {% d => new Exist(d[0], d[1] ?? []) %}
|
|
105
|
+
| primitiveOperation {% id %}
|
|
106
|
+
| cons_expr {% id %}
|
|
107
|
+
| "(" _ addition _ ")" {% d => d[2] %}
|
|
108
|
+
|
|
109
|
+
cons_expr -> "[" _ primary_list _ %consOp _ expression _ "]" {% (d) => new ConsExpression(d[2], d[6]) %}
|
|
110
|
+
|
|
111
|
+
primitiveOperation ->
|
|
112
|
+
"round" __ addition {% d => new ArithmeticUnaryOperation("Round", d[2]) %}
|
|
113
|
+
| "abs" __ addition {% d => new ArithmeticUnaryOperation("Absolute", d[2]) %}
|
|
114
|
+
| "sqrt" __ addition {% d => new ArithmeticUnaryOperation("Sqrt", d[2]) %}
|
|
115
|
+
|
|
116
|
+
primitiveArguments -> %lparen _ primary_list _ %rparen {% (d) => d[2] %}
|
|
117
|
+
primary_list -> addition (_ %comma _ addition):* {% (d) => [d[0], ...d[1].map(x => x[3])] %}
|
|
118
|
+
|
|
119
|
+
arguments -> %lparen _ pattern_list _ %rparen {% (d) => d[2] %}
|
|
120
|
+
|
|
121
|
+
pattern_list -> pattern (_ %comma _ pattern):* {% (d) => [d[0], ...d[1].map(x => x[3])] %}
|
|
122
|
+
|
|
123
|
+
pattern ->
|
|
124
|
+
variable {% (d) => new VariablePattern(d[0]) %}
|
|
125
|
+
| structural_literal {% (d) => new LiteralPattern(d[0]) %}
|
|
126
|
+
| %wildcard {% (d) => new WildcardPattern() %}
|
|
127
|
+
| any_atom arguments {% (d) => new FunctorPattern(d[0], d[1]) %}
|
|
128
|
+
| "(" _ pattern_list _ ")" {% (d) => new TuplePattern(d[2]) %}
|
|
129
|
+
| "[" _ pattern_list _ %consOp _ pattern _ "]" {% (d) => new ConsPattern(d[2].length > 1 ? new ListPattern(d[2]) : d[2][0], new VariablePattern(d[6])) %}
|
|
130
|
+
| "[" _ pattern_list:? _ "]" {% (d) => new ListPattern(d[2] ? d[2] : []) %}
|
|
131
|
+
|
|
132
|
+
variable -> %variable {% (d) => new SymbolPrimitive(d[0].value) %}
|
|
133
|
+
|
|
134
|
+
strict_atom -> %atom {% (d) => new SymbolPrimitive(d[0].value) %}
|
|
135
|
+
|
|
136
|
+
any_atom -> (%atom | %op | %comparisonOp) {% (d) => new SymbolPrimitive(d[0][0].value) %}
|
|
137
|
+
|
|
138
|
+
arithmetic_literal ->
|
|
139
|
+
strict_atom {% id %}
|
|
140
|
+
| %number {% (d) => new NumberPrimitive(Number(d[0].value)) %}
|
|
141
|
+
| %string {% (d) => new StringPrimitive(d[0].value) %}
|
|
142
|
+
|
|
143
|
+
structural_literal ->
|
|
144
|
+
any_atom {% id %}
|
|
145
|
+
| %number {% (d) => new NumberPrimitive(Number(d[0].value)) %}
|
|
146
|
+
| %string {% (d) => new StringPrimitive(d[0].value) %}
|
|
147
|
+
|
|
148
|
+
comparison_op ->
|
|
149
|
+
"=:=" {% d => "Equal" %}
|
|
150
|
+
| "=\\=" {% d => "NotEqual" %}
|
|
151
|
+
| "==" {% d => "Same" %}
|
|
152
|
+
| "\\==" {% d => "NotSame" %}
|
|
153
|
+
| "\\=" {% d => "NotSame" %}
|
|
154
|
+
| "@<" {% d => "LessThan" %}
|
|
155
|
+
| "@=<" {% d => "LessOrEqualThan" %}
|
|
156
|
+
| "@>" {% d => "GreaterThan" %}
|
|
157
|
+
| "@>=" {% d => "GreaterOrEqualThan" %}
|
|
158
|
+
| "<" {% d => "LessThan" %}
|
|
159
|
+
| "=<" {% d => "LessOrEqualThan" %}
|
|
160
|
+
| ">" {% d => "GreaterThan" %}
|
|
161
|
+
| ">=" {% d => "GreaterOrEqualThan" %}
|
|
162
|
+
| "=@=" {% d => "Same" %}
|
|
163
|
+
| "\\=@=" {% d => "NotSame" %}
|
|
164
|
+
|
|
165
|
+
_ -> %WS:*
|
|
166
|
+
__ -> %WS:?
|