mirror of
https://github.com/owncloud/ocis
synced 2026-04-25 17:25:21 +02:00
4b7349037f
Add NumericRestrictionNode to the KQL PEG grammar so that range operators work with numeric values, not just DateTimes. This enables queries like `size>=1048576`, `photo.iso>=100`, `photo.fNumber>=2.8`, and `photo.focalLength<50`. Changes: - ast: add NumericNode with Key, Operator, Value (float64) - kql/dictionary.peg: add NumericRestrictionNode and Number rules - kql/factory.go: add buildNumericNode() - kql/cast.go: add toFloat64() - bleve/compiler.go: compile NumericNode to NumericRangeQuery Fixes: #12093 Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
2971 lines
72 KiB
Go
2971 lines
72 KiB
Go
// Code generated by pigeon; DO NOT EDIT.
|
|
|
|
package kql
|
|
|
|
import (
|
|
"bytes"
|
|
"errors"
|
|
"fmt"
|
|
"io"
|
|
"math"
|
|
"os"
|
|
"sort"
|
|
"strconv"
|
|
"strings"
|
|
"sync"
|
|
"unicode"
|
|
"unicode/utf8"
|
|
)
|
|
|
|
var g = &grammar{
|
|
rules: []*rule{
|
|
{
|
|
name: "AST",
|
|
pos: position{line: 9, col: 1, offset: 143},
|
|
expr: &actionExpr{
|
|
pos: position{line: 10, col: 5, offset: 154},
|
|
run: (*parser).callonAST1,
|
|
expr: &labeledExpr{
|
|
pos: position{line: 10, col: 5, offset: 154},
|
|
label: "n",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 10, col: 7, offset: 156},
|
|
name: "Nodes",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Nodes",
|
|
pos: position{line: 18, col: 1, offset: 337},
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 19, col: 5, offset: 350},
|
|
expr: &seqExpr{
|
|
pos: position{line: 19, col: 6, offset: 351},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 19, col: 6, offset: 351},
|
|
name: "_",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 19, col: 8, offset: 353},
|
|
name: "Node",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Node",
|
|
pos: position{line: 21, col: 1, offset: 361},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 22, col: 5, offset: 373},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 22, col: 5, offset: 373},
|
|
name: "GroupNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 23, col: 5, offset: 389},
|
|
name: "PropertyRestrictionNodes",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 24, col: 5, offset: 420},
|
|
name: "OperatorBooleanNodes",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 25, col: 5, offset: 447},
|
|
name: "FreeTextKeywordNodes",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "GroupNode",
|
|
pos: position{line: 31, col: 1, offset: 595},
|
|
expr: &actionExpr{
|
|
pos: position{line: 32, col: 5, offset: 612},
|
|
run: (*parser).callonGroupNode1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 32, col: 5, offset: 612},
|
|
exprs: []any{
|
|
&labeledExpr{
|
|
pos: position{line: 32, col: 5, offset: 612},
|
|
label: "k",
|
|
expr: &zeroOrOneExpr{
|
|
pos: position{line: 32, col: 7, offset: 614},
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 32, col: 8, offset: 615},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 32, col: 8, offset: 615},
|
|
name: "Char",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 32, col: 16, offset: 623},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 32, col: 17, offset: 624},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 32, col: 17, offset: 624},
|
|
name: "OperatorColonNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 32, col: 37, offset: 644},
|
|
name: "OperatorEqualNode",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 32, col: 57, offset: 664},
|
|
val: "(",
|
|
ignoreCase: false,
|
|
want: "\"(\"",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 32, col: 61, offset: 668},
|
|
label: "v",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 32, col: 63, offset: 670},
|
|
name: "Nodes",
|
|
},
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 32, col: 69, offset: 676},
|
|
val: ")",
|
|
ignoreCase: false,
|
|
want: "\")\"",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "PropertyRestrictionNodes",
|
|
pos: position{line: 40, col: 1, offset: 880},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 41, col: 5, offset: 912},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 41, col: 5, offset: 912},
|
|
name: "YesNoPropertyRestrictionNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 42, col: 5, offset: 947},
|
|
name: "DateTimeRestrictionNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 43, col: 5, offset: 977},
|
|
name: "NumericRestrictionNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 44, col: 5, offset: 1006},
|
|
name: "TextPropertyRestrictionNode",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "YesNoPropertyRestrictionNode",
|
|
pos: position{line: 46, col: 1, offset: 1035},
|
|
expr: &actionExpr{
|
|
pos: position{line: 47, col: 5, offset: 1071},
|
|
run: (*parser).callonYesNoPropertyRestrictionNode1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 47, col: 5, offset: 1071},
|
|
exprs: []any{
|
|
&labeledExpr{
|
|
pos: position{line: 47, col: 5, offset: 1071},
|
|
label: "k",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 47, col: 7, offset: 1073},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 47, col: 7, offset: 1073},
|
|
name: "Char",
|
|
},
|
|
},
|
|
},
|
|
&choiceExpr{
|
|
pos: position{line: 47, col: 14, offset: 1080},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 47, col: 14, offset: 1080},
|
|
name: "OperatorColonNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 47, col: 34, offset: 1100},
|
|
name: "OperatorEqualNode",
|
|
},
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 47, col: 53, offset: 1119},
|
|
label: "v",
|
|
expr: &choiceExpr{
|
|
pos: position{line: 47, col: 56, offset: 1122},
|
|
alternatives: []any{
|
|
&litMatcher{
|
|
pos: position{line: 47, col: 56, offset: 1122},
|
|
val: "true",
|
|
ignoreCase: false,
|
|
want: "\"true\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 47, col: 65, offset: 1131},
|
|
val: "false",
|
|
ignoreCase: false,
|
|
want: "\"false\"",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "DateTimeRestrictionNode",
|
|
pos: position{line: 51, col: 1, offset: 1201},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 52, col: 5, offset: 1232},
|
|
alternatives: []any{
|
|
&actionExpr{
|
|
pos: position{line: 52, col: 5, offset: 1232},
|
|
run: (*parser).callonDateTimeRestrictionNode2,
|
|
expr: &seqExpr{
|
|
pos: position{line: 52, col: 5, offset: 1232},
|
|
exprs: []any{
|
|
&labeledExpr{
|
|
pos: position{line: 52, col: 5, offset: 1232},
|
|
label: "k",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 52, col: 7, offset: 1234},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 52, col: 7, offset: 1234},
|
|
name: "Char",
|
|
},
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 52, col: 13, offset: 1240},
|
|
label: "o",
|
|
expr: &choiceExpr{
|
|
pos: position{line: 53, col: 9, offset: 1252},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 53, col: 9, offset: 1252},
|
|
name: "OperatorGreaterOrEqualNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 54, col: 9, offset: 1289},
|
|
name: "OperatorLessOrEqualNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 55, col: 9, offset: 1323},
|
|
name: "OperatorGreaterNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 56, col: 9, offset: 1353},
|
|
name: "OperatorLessNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 57, col: 9, offset: 1380},
|
|
name: "OperatorEqualNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 58, col: 9, offset: 1408},
|
|
name: "OperatorColonNode",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 59, col: 7, offset: 1432},
|
|
expr: &litMatcher{
|
|
pos: position{line: 59, col: 7, offset: 1432},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
want: "\"\\\"\"",
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 59, col: 12, offset: 1437},
|
|
label: "v",
|
|
expr: &choiceExpr{
|
|
pos: position{line: 60, col: 9, offset: 1449},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 60, col: 9, offset: 1449},
|
|
name: "DateTime",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 61, col: 9, offset: 1468},
|
|
name: "FullDate",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 62, col: 9, offset: 1487},
|
|
name: "FullTime",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 63, col: 7, offset: 1502},
|
|
expr: &litMatcher{
|
|
pos: position{line: 63, col: 7, offset: 1502},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
want: "\"\\\"\"",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&actionExpr{
|
|
pos: position{line: 66, col: 5, offset: 1578},
|
|
run: (*parser).callonDateTimeRestrictionNode24,
|
|
expr: &seqExpr{
|
|
pos: position{line: 66, col: 5, offset: 1578},
|
|
exprs: []any{
|
|
&labeledExpr{
|
|
pos: position{line: 66, col: 5, offset: 1578},
|
|
label: "k",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 66, col: 7, offset: 1580},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 66, col: 7, offset: 1580},
|
|
name: "Char",
|
|
},
|
|
},
|
|
},
|
|
&choiceExpr{
|
|
pos: position{line: 67, col: 9, offset: 1596},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 67, col: 9, offset: 1596},
|
|
name: "OperatorEqualNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 68, col: 9, offset: 1624},
|
|
name: "OperatorColonNode",
|
|
},
|
|
},
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 69, col: 7, offset: 1648},
|
|
expr: &litMatcher{
|
|
pos: position{line: 69, col: 7, offset: 1648},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
want: "\"\\\"\"",
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 69, col: 12, offset: 1653},
|
|
label: "v",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 69, col: 14, offset: 1655},
|
|
name: "NaturalLanguageDateTime",
|
|
},
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 69, col: 38, offset: 1679},
|
|
expr: &litMatcher{
|
|
pos: position{line: 69, col: 38, offset: 1679},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
want: "\"\\\"\"",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "NumericRestrictionNode",
|
|
pos: position{line: 73, col: 1, offset: 1763},
|
|
expr: &actionExpr{
|
|
pos: position{line: 74, col: 5, offset: 1793},
|
|
run: (*parser).callonNumericRestrictionNode1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 74, col: 5, offset: 1793},
|
|
exprs: []any{
|
|
&labeledExpr{
|
|
pos: position{line: 74, col: 5, offset: 1793},
|
|
label: "k",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 74, col: 7, offset: 1795},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 74, col: 7, offset: 1795},
|
|
name: "Char",
|
|
},
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 74, col: 13, offset: 1801},
|
|
label: "o",
|
|
expr: &choiceExpr{
|
|
pos: position{line: 75, col: 9, offset: 1813},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 75, col: 9, offset: 1813},
|
|
name: "OperatorGreaterOrEqualNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 76, col: 9, offset: 1850},
|
|
name: "OperatorLessOrEqualNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 77, col: 9, offset: 1884},
|
|
name: "OperatorGreaterNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 78, col: 9, offset: 1914},
|
|
name: "OperatorLessNode",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 79, col: 7, offset: 1937},
|
|
label: "v",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 79, col: 9, offset: 1939},
|
|
name: "Number",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "TextPropertyRestrictionNode",
|
|
pos: position{line: 83, col: 1, offset: 2011},
|
|
expr: &actionExpr{
|
|
pos: position{line: 84, col: 5, offset: 2046},
|
|
run: (*parser).callonTextPropertyRestrictionNode1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 84, col: 5, offset: 2046},
|
|
exprs: []any{
|
|
&labeledExpr{
|
|
pos: position{line: 84, col: 5, offset: 2046},
|
|
label: "k",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 84, col: 7, offset: 2048},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 84, col: 7, offset: 2048},
|
|
name: "Char",
|
|
},
|
|
},
|
|
},
|
|
&choiceExpr{
|
|
pos: position{line: 84, col: 14, offset: 2055},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 84, col: 14, offset: 2055},
|
|
name: "OperatorColonNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 84, col: 34, offset: 2075},
|
|
name: "OperatorEqualNode",
|
|
},
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 84, col: 53, offset: 2094},
|
|
label: "v",
|
|
expr: &choiceExpr{
|
|
pos: position{line: 84, col: 56, offset: 2097},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 84, col: 56, offset: 2097},
|
|
name: "String",
|
|
},
|
|
&oneOrMoreExpr{
|
|
pos: position{line: 84, col: 65, offset: 2106},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 84, col: 65, offset: 2106},
|
|
val: "[^ ()]",
|
|
chars: []rune{' ', '(', ')'},
|
|
ignoreCase: false,
|
|
inverted: true,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "FreeTextKeywordNodes",
|
|
pos: position{line: 92, col: 1, offset: 2312},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 93, col: 5, offset: 2340},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 93, col: 5, offset: 2340},
|
|
name: "PhraseNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 94, col: 5, offset: 2357},
|
|
name: "WordNode",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "PhraseNode",
|
|
pos: position{line: 96, col: 1, offset: 2367},
|
|
expr: &actionExpr{
|
|
pos: position{line: 97, col: 6, offset: 2386},
|
|
run: (*parser).callonPhraseNode1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 97, col: 6, offset: 2386},
|
|
exprs: []any{
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 97, col: 6, offset: 2386},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 97, col: 6, offset: 2386},
|
|
name: "OperatorColonNode",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 97, col: 25, offset: 2405},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 97, col: 27, offset: 2407},
|
|
label: "v",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 97, col: 29, offset: 2409},
|
|
name: "String",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 97, col: 36, offset: 2416},
|
|
name: "_",
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 97, col: 38, offset: 2418},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 97, col: 38, offset: 2418},
|
|
name: "OperatorColonNode",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "WordNode",
|
|
pos: position{line: 101, col: 1, offset: 2499},
|
|
expr: &actionExpr{
|
|
pos: position{line: 102, col: 6, offset: 2516},
|
|
run: (*parser).callonWordNode1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 102, col: 6, offset: 2516},
|
|
exprs: []any{
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 102, col: 6, offset: 2516},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 102, col: 6, offset: 2516},
|
|
name: "OperatorColonNode",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 102, col: 25, offset: 2535},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 102, col: 27, offset: 2537},
|
|
label: "v",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 102, col: 29, offset: 2539},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 102, col: 29, offset: 2539},
|
|
val: "[^ :()]",
|
|
chars: []rune{' ', ':', '(', ')'},
|
|
ignoreCase: false,
|
|
inverted: true,
|
|
},
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 102, col: 38, offset: 2548},
|
|
name: "_",
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 102, col: 40, offset: 2550},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 102, col: 40, offset: 2550},
|
|
name: "OperatorColonNode",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorBooleanNodes",
|
|
pos: position{line: 110, col: 1, offset: 2759},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 111, col: 5, offset: 2787},
|
|
alternatives: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 111, col: 5, offset: 2787},
|
|
name: "OperatorBooleanAndNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 112, col: 5, offset: 2816},
|
|
name: "OperatorBooleanNotNode",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 113, col: 5, offset: 2845},
|
|
name: "OperatorBooleanOrNode",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorBooleanAndNode",
|
|
pos: position{line: 115, col: 1, offset: 2868},
|
|
expr: &actionExpr{
|
|
pos: position{line: 116, col: 5, offset: 2898},
|
|
run: (*parser).callonOperatorBooleanAndNode1,
|
|
expr: &choiceExpr{
|
|
pos: position{line: 116, col: 6, offset: 2899},
|
|
alternatives: []any{
|
|
&litMatcher{
|
|
pos: position{line: 116, col: 6, offset: 2899},
|
|
val: "AND",
|
|
ignoreCase: false,
|
|
want: "\"AND\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 116, col: 14, offset: 2907},
|
|
val: "+",
|
|
ignoreCase: false,
|
|
want: "\"+\"",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorBooleanNotNode",
|
|
pos: position{line: 120, col: 1, offset: 2969},
|
|
expr: &actionExpr{
|
|
pos: position{line: 121, col: 5, offset: 2999},
|
|
run: (*parser).callonOperatorBooleanNotNode1,
|
|
expr: &choiceExpr{
|
|
pos: position{line: 121, col: 6, offset: 3000},
|
|
alternatives: []any{
|
|
&litMatcher{
|
|
pos: position{line: 121, col: 6, offset: 3000},
|
|
val: "NOT",
|
|
ignoreCase: false,
|
|
want: "\"NOT\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 121, col: 14, offset: 3008},
|
|
val: "-",
|
|
ignoreCase: false,
|
|
want: "\"-\"",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorBooleanOrNode",
|
|
pos: position{line: 125, col: 1, offset: 3070},
|
|
expr: &actionExpr{
|
|
pos: position{line: 126, col: 5, offset: 3099},
|
|
run: (*parser).callonOperatorBooleanOrNode1,
|
|
expr: &litMatcher{
|
|
pos: position{line: 126, col: 6, offset: 3100},
|
|
val: "OR",
|
|
ignoreCase: false,
|
|
want: "\"OR\"",
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorColonNode",
|
|
pos: position{line: 130, col: 1, offset: 3163},
|
|
expr: &actionExpr{
|
|
pos: position{line: 131, col: 5, offset: 3188},
|
|
run: (*parser).callonOperatorColonNode1,
|
|
expr: &litMatcher{
|
|
pos: position{line: 131, col: 5, offset: 3188},
|
|
val: ":",
|
|
ignoreCase: false,
|
|
want: "\":\"",
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorEqualNode",
|
|
pos: position{line: 135, col: 1, offset: 3249},
|
|
expr: &actionExpr{
|
|
pos: position{line: 136, col: 5, offset: 3274},
|
|
run: (*parser).callonOperatorEqualNode1,
|
|
expr: &litMatcher{
|
|
pos: position{line: 136, col: 5, offset: 3274},
|
|
val: "=",
|
|
ignoreCase: false,
|
|
want: "\"=\"",
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorLessNode",
|
|
pos: position{line: 140, col: 1, offset: 3335},
|
|
expr: &actionExpr{
|
|
pos: position{line: 141, col: 5, offset: 3359},
|
|
run: (*parser).callonOperatorLessNode1,
|
|
expr: &litMatcher{
|
|
pos: position{line: 141, col: 5, offset: 3359},
|
|
val: "<",
|
|
ignoreCase: false,
|
|
want: "\"<\"",
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorLessOrEqualNode",
|
|
pos: position{line: 145, col: 1, offset: 3420},
|
|
expr: &actionExpr{
|
|
pos: position{line: 146, col: 5, offset: 3451},
|
|
run: (*parser).callonOperatorLessOrEqualNode1,
|
|
expr: &litMatcher{
|
|
pos: position{line: 146, col: 5, offset: 3451},
|
|
val: "<=",
|
|
ignoreCase: false,
|
|
want: "\"<=\"",
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorGreaterNode",
|
|
pos: position{line: 150, col: 1, offset: 3513},
|
|
expr: &actionExpr{
|
|
pos: position{line: 151, col: 5, offset: 3540},
|
|
run: (*parser).callonOperatorGreaterNode1,
|
|
expr: &litMatcher{
|
|
pos: position{line: 151, col: 5, offset: 3540},
|
|
val: ">",
|
|
ignoreCase: false,
|
|
want: "\">\"",
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "OperatorGreaterOrEqualNode",
|
|
pos: position{line: 155, col: 1, offset: 3601},
|
|
expr: &actionExpr{
|
|
pos: position{line: 156, col: 5, offset: 3635},
|
|
run: (*parser).callonOperatorGreaterOrEqualNode1,
|
|
expr: &litMatcher{
|
|
pos: position{line: 156, col: 5, offset: 3635},
|
|
val: ">=",
|
|
ignoreCase: false,
|
|
want: "\">=\"",
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "TimeYear",
|
|
pos: position{line: 165, col: 1, offset: 3821},
|
|
expr: &actionExpr{
|
|
pos: position{line: 166, col: 5, offset: 3837},
|
|
run: (*parser).callonTimeYear1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 166, col: 5, offset: 3837},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 166, col: 5, offset: 3837},
|
|
name: "Digit",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 166, col: 11, offset: 3843},
|
|
name: "Digit",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 166, col: 17, offset: 3849},
|
|
name: "Digit",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 166, col: 23, offset: 3855},
|
|
name: "Digit",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "TimeMonth",
|
|
pos: position{line: 170, col: 1, offset: 3897},
|
|
expr: &actionExpr{
|
|
pos: position{line: 171, col: 5, offset: 3914},
|
|
run: (*parser).callonTimeMonth1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 171, col: 5, offset: 3914},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 171, col: 5, offset: 3914},
|
|
name: "Digit",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 171, col: 11, offset: 3920},
|
|
name: "Digit",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "TimeDay",
|
|
pos: position{line: 175, col: 1, offset: 3962},
|
|
expr: &actionExpr{
|
|
pos: position{line: 176, col: 5, offset: 3977},
|
|
run: (*parser).callonTimeDay1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 176, col: 5, offset: 3977},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 176, col: 5, offset: 3977},
|
|
name: "Digit",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 176, col: 11, offset: 3983},
|
|
name: "Digit",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "TimeHour",
|
|
pos: position{line: 180, col: 1, offset: 4025},
|
|
expr: &actionExpr{
|
|
pos: position{line: 181, col: 5, offset: 4041},
|
|
run: (*parser).callonTimeHour1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 181, col: 5, offset: 4041},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 181, col: 5, offset: 4041},
|
|
name: "Digit",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 181, col: 11, offset: 4047},
|
|
name: "Digit",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "TimeMinute",
|
|
pos: position{line: 185, col: 1, offset: 4089},
|
|
expr: &actionExpr{
|
|
pos: position{line: 186, col: 5, offset: 4107},
|
|
run: (*parser).callonTimeMinute1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 186, col: 5, offset: 4107},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 186, col: 5, offset: 4107},
|
|
name: "Digit",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 186, col: 11, offset: 4113},
|
|
name: "Digit",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "TimeSecond",
|
|
pos: position{line: 190, col: 1, offset: 4155},
|
|
expr: &actionExpr{
|
|
pos: position{line: 191, col: 5, offset: 4173},
|
|
run: (*parser).callonTimeSecond1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 191, col: 5, offset: 4173},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 191, col: 5, offset: 4173},
|
|
name: "Digit",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 191, col: 11, offset: 4179},
|
|
name: "Digit",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "FullDate",
|
|
pos: position{line: 195, col: 1, offset: 4221},
|
|
expr: &actionExpr{
|
|
pos: position{line: 196, col: 5, offset: 4237},
|
|
run: (*parser).callonFullDate1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 196, col: 5, offset: 4237},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 196, col: 5, offset: 4237},
|
|
name: "TimeYear",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 196, col: 14, offset: 4246},
|
|
val: "-",
|
|
ignoreCase: false,
|
|
want: "\"-\"",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 196, col: 18, offset: 4250},
|
|
name: "TimeMonth",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 196, col: 28, offset: 4260},
|
|
val: "-",
|
|
ignoreCase: false,
|
|
want: "\"-\"",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 196, col: 32, offset: 4264},
|
|
name: "TimeDay",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "FullTime",
|
|
pos: position{line: 200, col: 1, offset: 4308},
|
|
expr: &actionExpr{
|
|
pos: position{line: 201, col: 5, offset: 4324},
|
|
run: (*parser).callonFullTime1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 201, col: 5, offset: 4324},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 201, col: 5, offset: 4324},
|
|
name: "TimeHour",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 201, col: 14, offset: 4333},
|
|
val: ":",
|
|
ignoreCase: false,
|
|
want: "\":\"",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 201, col: 18, offset: 4337},
|
|
name: "TimeMinute",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 201, col: 29, offset: 4348},
|
|
val: ":",
|
|
ignoreCase: false,
|
|
want: "\":\"",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 201, col: 33, offset: 4352},
|
|
name: "TimeSecond",
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 201, col: 44, offset: 4363},
|
|
expr: &seqExpr{
|
|
pos: position{line: 201, col: 45, offset: 4364},
|
|
exprs: []any{
|
|
&litMatcher{
|
|
pos: position{line: 201, col: 45, offset: 4364},
|
|
val: ".",
|
|
ignoreCase: false,
|
|
want: "\".\"",
|
|
},
|
|
&oneOrMoreExpr{
|
|
pos: position{line: 201, col: 49, offset: 4368},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 201, col: 49, offset: 4368},
|
|
name: "Digit",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&choiceExpr{
|
|
pos: position{line: 201, col: 59, offset: 4378},
|
|
alternatives: []any{
|
|
&litMatcher{
|
|
pos: position{line: 201, col: 59, offset: 4378},
|
|
val: "Z",
|
|
ignoreCase: false,
|
|
want: "\"Z\"",
|
|
},
|
|
&seqExpr{
|
|
pos: position{line: 201, col: 65, offset: 4384},
|
|
exprs: []any{
|
|
&choiceExpr{
|
|
pos: position{line: 201, col: 66, offset: 4385},
|
|
alternatives: []any{
|
|
&litMatcher{
|
|
pos: position{line: 201, col: 66, offset: 4385},
|
|
val: "+",
|
|
ignoreCase: false,
|
|
want: "\"+\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 201, col: 72, offset: 4391},
|
|
val: "-",
|
|
ignoreCase: false,
|
|
want: "\"-\"",
|
|
},
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 201, col: 77, offset: 4396},
|
|
name: "TimeHour",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 201, col: 86, offset: 4405},
|
|
val: ":",
|
|
ignoreCase: false,
|
|
want: "\":\"",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 201, col: 90, offset: 4409},
|
|
name: "TimeMinute",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "DateTime",
|
|
pos: position{line: 205, col: 1, offset: 4457},
|
|
expr: &actionExpr{
|
|
pos: position{line: 206, col: 5, offset: 4474},
|
|
run: (*parser).callonDateTime1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 206, col: 5, offset: 4474},
|
|
exprs: []any{
|
|
&ruleRefExpr{
|
|
pos: position{line: 206, col: 5, offset: 4474},
|
|
name: "FullDate",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 206, col: 14, offset: 4483},
|
|
val: "T",
|
|
ignoreCase: false,
|
|
want: "\"T\"",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 206, col: 18, offset: 4487},
|
|
name: "FullTime",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "NaturalLanguageDateTime",
|
|
pos: position{line: 210, col: 1, offset: 4530},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 211, col: 5, offset: 4562},
|
|
alternatives: []any{
|
|
&litMatcher{
|
|
pos: position{line: 211, col: 5, offset: 4562},
|
|
val: "today",
|
|
ignoreCase: false,
|
|
want: "\"today\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 212, col: 5, offset: 4576},
|
|
val: "yesterday",
|
|
ignoreCase: false,
|
|
want: "\"yesterday\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 213, col: 5, offset: 4594},
|
|
val: "this week",
|
|
ignoreCase: false,
|
|
want: "\"this week\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 214, col: 5, offset: 4612},
|
|
val: "last week",
|
|
ignoreCase: false,
|
|
want: "\"last week\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 215, col: 5, offset: 4630},
|
|
val: "last 7 days",
|
|
ignoreCase: false,
|
|
want: "\"last 7 days\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 216, col: 5, offset: 4650},
|
|
val: "this month",
|
|
ignoreCase: false,
|
|
want: "\"this month\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 217, col: 5, offset: 4669},
|
|
val: "last month",
|
|
ignoreCase: false,
|
|
want: "\"last month\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 218, col: 5, offset: 4688},
|
|
val: "last 30 days",
|
|
ignoreCase: false,
|
|
want: "\"last 30 days\"",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 219, col: 5, offset: 4709},
|
|
val: "this year",
|
|
ignoreCase: false,
|
|
want: "\"this year\"",
|
|
},
|
|
&actionExpr{
|
|
pos: position{line: 220, col: 5, offset: 4727},
|
|
run: (*parser).callonNaturalLanguageDateTime11,
|
|
expr: &litMatcher{
|
|
pos: position{line: 220, col: 5, offset: 4727},
|
|
val: "last year",
|
|
ignoreCase: false,
|
|
want: "\"last year\"",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Char",
|
|
pos: position{line: 228, col: 1, offset: 4899},
|
|
expr: &actionExpr{
|
|
pos: position{line: 229, col: 5, offset: 4911},
|
|
run: (*parser).callonChar1,
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 229, col: 5, offset: 4911},
|
|
val: "[A-Za-z.]",
|
|
chars: []rune{'.'},
|
|
ranges: []rune{'A', 'Z', 'a', 'z'},
|
|
ignoreCase: false,
|
|
inverted: false,
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "String",
|
|
pos: position{line: 233, col: 1, offset: 4957},
|
|
expr: &actionExpr{
|
|
pos: position{line: 234, col: 5, offset: 4971},
|
|
run: (*parser).callonString1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 234, col: 5, offset: 4971},
|
|
exprs: []any{
|
|
&litMatcher{
|
|
pos: position{line: 234, col: 5, offset: 4971},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
want: "\"\\\"\"",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 234, col: 9, offset: 4975},
|
|
label: "v",
|
|
expr: &zeroOrMoreExpr{
|
|
pos: position{line: 234, col: 11, offset: 4977},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 234, col: 11, offset: 4977},
|
|
val: "[^\"]",
|
|
chars: []rune{'"'},
|
|
ignoreCase: false,
|
|
inverted: true,
|
|
},
|
|
},
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 234, col: 17, offset: 4983},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
want: "\"\\\"\"",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Number",
|
|
pos: position{line: 238, col: 1, offset: 5018},
|
|
expr: &actionExpr{
|
|
pos: position{line: 239, col: 5, offset: 5032},
|
|
run: (*parser).callonNumber1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 239, col: 5, offset: 5032},
|
|
exprs: []any{
|
|
&oneOrMoreExpr{
|
|
pos: position{line: 239, col: 5, offset: 5032},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 239, col: 5, offset: 5032},
|
|
val: "[0-9]",
|
|
ranges: []rune{'0', '9'},
|
|
ignoreCase: false,
|
|
inverted: false,
|
|
},
|
|
},
|
|
&zeroOrOneExpr{
|
|
pos: position{line: 239, col: 12, offset: 5039},
|
|
expr: &seqExpr{
|
|
pos: position{line: 239, col: 13, offset: 5040},
|
|
exprs: []any{
|
|
&litMatcher{
|
|
pos: position{line: 239, col: 13, offset: 5040},
|
|
val: ".",
|
|
ignoreCase: false,
|
|
want: "\".\"",
|
|
},
|
|
&oneOrMoreExpr{
|
|
pos: position{line: 239, col: 17, offset: 5044},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 239, col: 17, offset: 5044},
|
|
val: "[0-9]",
|
|
ranges: []rune{'0', '9'},
|
|
ignoreCase: false,
|
|
inverted: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Digit",
|
|
pos: position{line: 243, col: 1, offset: 5089},
|
|
expr: &actionExpr{
|
|
pos: position{line: 244, col: 5, offset: 5102},
|
|
run: (*parser).callonDigit1,
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 244, col: 5, offset: 5102},
|
|
val: "[0-9]",
|
|
ranges: []rune{'0', '9'},
|
|
ignoreCase: false,
|
|
inverted: false,
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "_",
|
|
pos: position{line: 248, col: 1, offset: 5144},
|
|
expr: &actionExpr{
|
|
pos: position{line: 249, col: 5, offset: 5153},
|
|
run: (*parser).callon_1,
|
|
expr: &zeroOrMoreExpr{
|
|
pos: position{line: 249, col: 5, offset: 5153},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 249, col: 5, offset: 5153},
|
|
val: "[ \\t]",
|
|
chars: []rune{' ', '\t'},
|
|
ignoreCase: false,
|
|
inverted: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
}
|
|
|
|
func (c *current) onAST1(n any) (any, error) {
|
|
return buildAST(n, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonAST1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onAST1(stack["n"])
|
|
}
|
|
|
|
func (c *current) onGroupNode1(k, v any) (any, error) {
|
|
return buildGroupNode(k, v, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonGroupNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onGroupNode1(stack["k"], stack["v"])
|
|
}
|
|
|
|
func (c *current) onYesNoPropertyRestrictionNode1(k, v any) (any, error) {
|
|
return buildBooleanNode(k, v, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonYesNoPropertyRestrictionNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onYesNoPropertyRestrictionNode1(stack["k"], stack["v"])
|
|
}
|
|
|
|
func (c *current) onDateTimeRestrictionNode2(k, o, v any) (any, error) {
|
|
return buildDateTimeNode(k, o, v, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonDateTimeRestrictionNode2() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onDateTimeRestrictionNode2(stack["k"], stack["o"], stack["v"])
|
|
}
|
|
|
|
func (c *current) onDateTimeRestrictionNode24(k, v any) (any, error) {
|
|
return buildNaturalLanguageDateTimeNodes(k, v, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonDateTimeRestrictionNode24() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onDateTimeRestrictionNode24(stack["k"], stack["v"])
|
|
}
|
|
|
|
func (c *current) onNumericRestrictionNode1(k, o, v any) (any, error) {
|
|
return buildNumericNode(k, o, v, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonNumericRestrictionNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onNumericRestrictionNode1(stack["k"], stack["o"], stack["v"])
|
|
}
|
|
|
|
func (c *current) onTextPropertyRestrictionNode1(k, v any) (any, error) {
|
|
return buildStringNode(k, v, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonTextPropertyRestrictionNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onTextPropertyRestrictionNode1(stack["k"], stack["v"])
|
|
}
|
|
|
|
func (c *current) onPhraseNode1(v any) (any, error) {
|
|
return buildStringNode("", v, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonPhraseNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onPhraseNode1(stack["v"])
|
|
}
|
|
|
|
func (c *current) onWordNode1(v any) (any, error) {
|
|
return buildStringNode("", v, c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonWordNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onWordNode1(stack["v"])
|
|
}
|
|
|
|
func (c *current) onOperatorBooleanAndNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorBooleanAndNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorBooleanAndNode1()
|
|
}
|
|
|
|
func (c *current) onOperatorBooleanNotNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorBooleanNotNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorBooleanNotNode1()
|
|
}
|
|
|
|
func (c *current) onOperatorBooleanOrNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorBooleanOrNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorBooleanOrNode1()
|
|
}
|
|
|
|
func (c *current) onOperatorColonNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorColonNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorColonNode1()
|
|
}
|
|
|
|
func (c *current) onOperatorEqualNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorEqualNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorEqualNode1()
|
|
}
|
|
|
|
func (c *current) onOperatorLessNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorLessNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorLessNode1()
|
|
}
|
|
|
|
func (c *current) onOperatorLessOrEqualNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorLessOrEqualNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorLessOrEqualNode1()
|
|
}
|
|
|
|
func (c *current) onOperatorGreaterNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorGreaterNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorGreaterNode1()
|
|
}
|
|
|
|
func (c *current) onOperatorGreaterOrEqualNode1() (any, error) {
|
|
return buildOperatorNode(c.text, c.pos)
|
|
|
|
}
|
|
|
|
func (p *parser) callonOperatorGreaterOrEqualNode1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onOperatorGreaterOrEqualNode1()
|
|
}
|
|
|
|
func (c *current) onTimeYear1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonTimeYear1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onTimeYear1()
|
|
}
|
|
|
|
func (c *current) onTimeMonth1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonTimeMonth1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onTimeMonth1()
|
|
}
|
|
|
|
func (c *current) onTimeDay1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonTimeDay1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onTimeDay1()
|
|
}
|
|
|
|
func (c *current) onTimeHour1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonTimeHour1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onTimeHour1()
|
|
}
|
|
|
|
func (c *current) onTimeMinute1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonTimeMinute1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onTimeMinute1()
|
|
}
|
|
|
|
func (c *current) onTimeSecond1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonTimeSecond1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onTimeSecond1()
|
|
}
|
|
|
|
func (c *current) onFullDate1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonFullDate1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onFullDate1()
|
|
}
|
|
|
|
func (c *current) onFullTime1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonFullTime1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onFullTime1()
|
|
}
|
|
|
|
func (c *current) onDateTime1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonDateTime1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onDateTime1()
|
|
}
|
|
|
|
func (c *current) onNaturalLanguageDateTime11() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonNaturalLanguageDateTime11() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onNaturalLanguageDateTime11()
|
|
}
|
|
|
|
func (c *current) onChar1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonChar1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onChar1()
|
|
}
|
|
|
|
func (c *current) onString1(v any) (any, error) {
|
|
return v, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonString1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onString1(stack["v"])
|
|
}
|
|
|
|
func (c *current) onNumber1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonNumber1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onNumber1()
|
|
}
|
|
|
|
func (c *current) onDigit1() (any, error) {
|
|
return c.text, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callonDigit1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onDigit1()
|
|
}
|
|
|
|
func (c *current) on_1() (any, error) {
|
|
return nil, nil
|
|
|
|
}
|
|
|
|
func (p *parser) callon_1() (any, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.on_1()
|
|
}
|
|
|
|
var (
|
|
// errNoRule is returned when the grammar to parse has no rule.
|
|
errNoRule = errors.New("grammar has no rule")
|
|
|
|
// errInvalidEntrypoint is returned when the specified entrypoint rule
|
|
// does not exit.
|
|
errInvalidEntrypoint = errors.New("invalid entrypoint")
|
|
|
|
// errInvalidEncoding is returned when the source is not properly
|
|
// utf8-encoded.
|
|
errInvalidEncoding = errors.New("invalid encoding")
|
|
|
|
// errMaxExprCnt is used to signal that the maximum number of
|
|
// expressions have been parsed.
|
|
errMaxExprCnt = errors.New("max number of expresssions parsed")
|
|
)
|
|
|
|
// Option is a function that can set an option on the parser. It returns
|
|
// the previous setting as an Option.
|
|
type Option func(*parser) Option
|
|
|
|
// MaxExpressions creates an Option to stop parsing after the provided
|
|
// number of expressions have been parsed, if the value is 0 then the parser will
|
|
// parse for as many steps as needed (possibly an infinite number).
|
|
//
|
|
// The default for maxExprCnt is 0.
|
|
func MaxExpressions(maxExprCnt uint64) Option {
|
|
return func(p *parser) Option {
|
|
oldMaxExprCnt := p.maxExprCnt
|
|
p.maxExprCnt = maxExprCnt
|
|
return MaxExpressions(oldMaxExprCnt)
|
|
}
|
|
}
|
|
|
|
// Entrypoint creates an Option to set the rule name to use as entrypoint.
|
|
// The rule name must have been specified in the -alternate-entrypoints
|
|
// if generating the parser with the -optimize-grammar flag, otherwise
|
|
// it may have been optimized out. Passing an empty string sets the
|
|
// entrypoint to the first rule in the grammar.
|
|
//
|
|
// The default is to start parsing at the first rule in the grammar.
|
|
func Entrypoint(ruleName string) Option {
|
|
return func(p *parser) Option {
|
|
oldEntrypoint := p.entrypoint
|
|
p.entrypoint = ruleName
|
|
if ruleName == "" {
|
|
p.entrypoint = g.rules[0].name
|
|
}
|
|
return Entrypoint(oldEntrypoint)
|
|
}
|
|
}
|
|
|
|
// Statistics adds a user provided Stats struct to the parser to allow
|
|
// the user to process the results after the parsing has finished.
|
|
// Also the key for the "no match" counter is set.
|
|
//
|
|
// Example usage:
|
|
//
|
|
// input := "input"
|
|
// stats := Stats{}
|
|
// _, err := Parse("input-file", []byte(input), Statistics(&stats, "no match"))
|
|
// if err != nil {
|
|
// log.Panicln(err)
|
|
// }
|
|
// b, err := json.MarshalIndent(stats.ChoiceAltCnt, "", " ")
|
|
// if err != nil {
|
|
// log.Panicln(err)
|
|
// }
|
|
// fmt.Println(string(b))
|
|
func Statistics(stats *Stats, choiceNoMatch string) Option {
|
|
return func(p *parser) Option {
|
|
oldStats := p.Stats
|
|
p.Stats = stats
|
|
oldChoiceNoMatch := p.choiceNoMatch
|
|
p.choiceNoMatch = choiceNoMatch
|
|
if p.Stats.ChoiceAltCnt == nil {
|
|
p.Stats.ChoiceAltCnt = make(map[string]map[string]int)
|
|
}
|
|
return Statistics(oldStats, oldChoiceNoMatch)
|
|
}
|
|
}
|
|
|
|
// Debug creates an Option to set the debug flag to b. When set to true,
|
|
// debugging information is printed to stdout while parsing.
|
|
//
|
|
// The default is false.
|
|
func Debug(b bool) Option {
|
|
return func(p *parser) Option {
|
|
old := p.debug
|
|
p.debug = b
|
|
return Debug(old)
|
|
}
|
|
}
|
|
|
|
// Memoize creates an Option to set the memoize flag to b. When set to true,
|
|
// the parser will cache all results so each expression is evaluated only
|
|
// once. This guarantees linear parsing time even for pathological cases,
|
|
// at the expense of more memory and slower times for typical cases.
|
|
//
|
|
// The default is false.
|
|
func Memoize(b bool) Option {
|
|
return func(p *parser) Option {
|
|
old := p.memoize
|
|
p.memoize = b
|
|
return Memoize(old)
|
|
}
|
|
}
|
|
|
|
// AllowInvalidUTF8 creates an Option to allow invalid UTF-8 bytes.
|
|
// Every invalid UTF-8 byte is treated as a utf8.RuneError (U+FFFD)
|
|
// by character class matchers and is matched by the any matcher.
|
|
// The returned matched value, c.text and c.offset are NOT affected.
|
|
//
|
|
// The default is false.
|
|
func AllowInvalidUTF8(b bool) Option {
|
|
return func(p *parser) Option {
|
|
old := p.allowInvalidUTF8
|
|
p.allowInvalidUTF8 = b
|
|
return AllowInvalidUTF8(old)
|
|
}
|
|
}
|
|
|
|
// Recover creates an Option to set the recover flag to b. When set to
|
|
// true, this causes the parser to recover from panics and convert it
|
|
// to an error. Setting it to false can be useful while debugging to
|
|
// access the full stack trace.
|
|
//
|
|
// The default is true.
|
|
func Recover(b bool) Option {
|
|
return func(p *parser) Option {
|
|
old := p.recover
|
|
p.recover = b
|
|
return Recover(old)
|
|
}
|
|
}
|
|
|
|
// GlobalStore creates an Option to set a key to a certain value in
|
|
// the globalStore.
|
|
func GlobalStore(key string, value any) Option {
|
|
return func(p *parser) Option {
|
|
old := p.cur.globalStore[key]
|
|
p.cur.globalStore[key] = value
|
|
return GlobalStore(key, old)
|
|
}
|
|
}
|
|
|
|
// InitState creates an Option to set a key to a certain value in
|
|
// the global "state" store.
|
|
func InitState(key string, value any) Option {
|
|
return func(p *parser) Option {
|
|
old := p.cur.state[key]
|
|
p.cur.state[key] = value
|
|
return InitState(key, old)
|
|
}
|
|
}
|
|
|
|
// ParseFile parses the file identified by filename.
|
|
func ParseFile(filename string, opts ...Option) (i any, err error) {
|
|
f, err := os.Open(filename)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
defer func() {
|
|
if closeErr := f.Close(); closeErr != nil {
|
|
err = closeErr
|
|
}
|
|
}()
|
|
return ParseReader(filename, f, opts...)
|
|
}
|
|
|
|
// ParseReader parses the data from r using filename as information in the
|
|
// error messages.
|
|
func ParseReader(filename string, r io.Reader, opts ...Option) (any, error) {
|
|
b, err := io.ReadAll(r)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
return Parse(filename, b, opts...)
|
|
}
|
|
|
|
// Parse parses the data from b using filename as information in the
|
|
// error messages.
|
|
func Parse(filename string, b []byte, opts ...Option) (any, error) {
|
|
return newParser(filename, b, opts...).parse(g)
|
|
}
|
|
|
|
// position records a position in the text.
|
|
type position struct {
|
|
line, col, offset int
|
|
}
|
|
|
|
func (p position) String() string {
|
|
return strconv.Itoa(p.line) + ":" + strconv.Itoa(p.col) + " [" + strconv.Itoa(p.offset) + "]"
|
|
}
|
|
|
|
// savepoint stores all state required to go back to this point in the
|
|
// parser.
|
|
type savepoint struct {
|
|
position
|
|
rn rune
|
|
w int
|
|
}
|
|
|
|
type current struct {
|
|
pos position // start position of the match
|
|
text []byte // raw text of the match
|
|
|
|
// state is a store for arbitrary key,value pairs that the user wants to be
|
|
// tied to the backtracking of the parser.
|
|
// This is always rolled back if a parsing rule fails.
|
|
state storeDict
|
|
|
|
// globalStore is a general store for the user to store arbitrary key-value
|
|
// pairs that they need to manage and that they do not want tied to the
|
|
// backtracking of the parser. This is only modified by the user and never
|
|
// rolled back by the parser. It is always up to the user to keep this in a
|
|
// consistent state.
|
|
globalStore storeDict
|
|
}
|
|
|
|
type storeDict map[string]any
|
|
|
|
// the AST types...
|
|
|
|
type grammar struct {
|
|
pos position
|
|
rules []*rule
|
|
}
|
|
|
|
type rule struct {
|
|
pos position
|
|
name string
|
|
displayName string
|
|
expr any
|
|
}
|
|
|
|
type choiceExpr struct {
|
|
pos position
|
|
alternatives []any
|
|
}
|
|
|
|
type actionExpr struct {
|
|
pos position
|
|
expr any
|
|
run func(*parser) (any, error)
|
|
}
|
|
|
|
type recoveryExpr struct {
|
|
pos position
|
|
expr any
|
|
recoverExpr any
|
|
failureLabel []string
|
|
}
|
|
|
|
type seqExpr struct {
|
|
pos position
|
|
exprs []any
|
|
}
|
|
|
|
type throwExpr struct {
|
|
pos position
|
|
label string
|
|
}
|
|
|
|
type labeledExpr struct {
|
|
pos position
|
|
label string
|
|
expr any
|
|
}
|
|
|
|
type expr struct {
|
|
pos position
|
|
expr any
|
|
}
|
|
|
|
type (
|
|
andExpr expr
|
|
notExpr expr
|
|
zeroOrOneExpr expr
|
|
zeroOrMoreExpr expr
|
|
oneOrMoreExpr expr
|
|
)
|
|
|
|
type ruleRefExpr struct {
|
|
pos position
|
|
name string
|
|
}
|
|
|
|
type stateCodeExpr struct {
|
|
pos position
|
|
run func(*parser) error
|
|
}
|
|
|
|
type andCodeExpr struct {
|
|
pos position
|
|
run func(*parser) (bool, error)
|
|
}
|
|
|
|
type notCodeExpr struct {
|
|
pos position
|
|
run func(*parser) (bool, error)
|
|
}
|
|
|
|
type litMatcher struct {
|
|
pos position
|
|
val string
|
|
ignoreCase bool
|
|
want string
|
|
}
|
|
|
|
type charClassMatcher struct {
|
|
pos position
|
|
val string
|
|
basicLatinChars [128]bool
|
|
chars []rune
|
|
ranges []rune
|
|
classes []*unicode.RangeTable
|
|
ignoreCase bool
|
|
inverted bool
|
|
}
|
|
|
|
type anyMatcher position
|
|
|
|
// errList cumulates the errors found by the parser.
|
|
type errList []error
|
|
|
|
func (e *errList) add(err error) {
|
|
*e = append(*e, err)
|
|
}
|
|
|
|
func (e errList) err() error {
|
|
if len(e) == 0 {
|
|
return nil
|
|
}
|
|
e.dedupe()
|
|
return e
|
|
}
|
|
|
|
func (e *errList) dedupe() {
|
|
var cleaned []error
|
|
set := make(map[string]bool)
|
|
for _, err := range *e {
|
|
if msg := err.Error(); !set[msg] {
|
|
set[msg] = true
|
|
cleaned = append(cleaned, err)
|
|
}
|
|
}
|
|
*e = cleaned
|
|
}
|
|
|
|
func (e errList) Error() string {
|
|
switch len(e) {
|
|
case 0:
|
|
return ""
|
|
case 1:
|
|
return e[0].Error()
|
|
default:
|
|
var buf bytes.Buffer
|
|
|
|
for i, err := range e {
|
|
if i > 0 {
|
|
buf.WriteRune('\n')
|
|
}
|
|
buf.WriteString(err.Error())
|
|
}
|
|
return buf.String()
|
|
}
|
|
}
|
|
|
|
// parserError wraps an error with a prefix indicating the rule in which
|
|
// the error occurred. The original error is stored in the Inner field.
|
|
type parserError struct {
|
|
Inner error
|
|
pos position
|
|
prefix string
|
|
expected []string
|
|
}
|
|
|
|
// Error returns the error message.
|
|
func (p *parserError) Error() string {
|
|
return p.prefix + ": " + p.Inner.Error()
|
|
}
|
|
|
|
// newParser creates a parser with the specified input source and options.
|
|
func newParser(filename string, b []byte, opts ...Option) *parser {
|
|
stats := Stats{
|
|
ChoiceAltCnt: make(map[string]map[string]int),
|
|
}
|
|
|
|
p := &parser{
|
|
filename: filename,
|
|
errs: new(errList),
|
|
data: b,
|
|
pt: savepoint{position: position{line: 1}},
|
|
recover: true,
|
|
cur: current{
|
|
state: make(storeDict),
|
|
globalStore: make(storeDict),
|
|
},
|
|
maxFailPos: position{col: 1, line: 1},
|
|
maxFailExpected: make([]string, 0, 20),
|
|
Stats: &stats,
|
|
// start rule is rule [0] unless an alternate entrypoint is specified
|
|
entrypoint: g.rules[0].name,
|
|
}
|
|
p.setOptions(opts)
|
|
|
|
if p.maxExprCnt == 0 {
|
|
p.maxExprCnt = math.MaxUint64
|
|
}
|
|
|
|
return p
|
|
}
|
|
|
|
// setOptions applies the options to the parser.
|
|
func (p *parser) setOptions(opts []Option) {
|
|
for _, opt := range opts {
|
|
opt(p)
|
|
}
|
|
}
|
|
|
|
type resultTuple struct {
|
|
v any
|
|
b bool
|
|
end savepoint
|
|
}
|
|
|
|
const choiceNoMatch = -1
|
|
|
|
// Stats stores some statistics, gathered during parsing
|
|
type Stats struct {
|
|
// ExprCnt counts the number of expressions processed during parsing
|
|
// This value is compared to the maximum number of expressions allowed
|
|
// (set by the MaxExpressions option).
|
|
ExprCnt uint64
|
|
|
|
// ChoiceAltCnt is used to count for each ordered choice expression,
|
|
// which alternative is used how may times.
|
|
// These numbers allow to optimize the order of the ordered choice expression
|
|
// to increase the performance of the parser
|
|
//
|
|
// The outer key of ChoiceAltCnt is composed of the name of the rule as well
|
|
// as the line and the column of the ordered choice.
|
|
// The inner key of ChoiceAltCnt is the number (one-based) of the matching alternative.
|
|
// For each alternative the number of matches are counted. If an ordered choice does not
|
|
// match, a special counter is incremented. The name of this counter is set with
|
|
// the parser option Statistics.
|
|
// For an alternative to be included in ChoiceAltCnt, it has to match at least once.
|
|
ChoiceAltCnt map[string]map[string]int
|
|
}
|
|
|
|
type parser struct {
|
|
filename string
|
|
pt savepoint
|
|
cur current
|
|
|
|
data []byte
|
|
errs *errList
|
|
|
|
depth int
|
|
recover bool
|
|
debug bool
|
|
|
|
memoize bool
|
|
// memoization table for the packrat algorithm:
|
|
// map[offset in source] map[expression or rule] {value, match}
|
|
memo map[int]map[any]resultTuple
|
|
|
|
// rules table, maps the rule identifier to the rule node
|
|
rules map[string]*rule
|
|
// variables stack, map of label to value
|
|
vstack []map[string]any
|
|
// rule stack, allows identification of the current rule in errors
|
|
rstack []*rule
|
|
|
|
// parse fail
|
|
maxFailPos position
|
|
maxFailExpected []string
|
|
maxFailInvertExpected bool
|
|
|
|
// max number of expressions to be parsed
|
|
maxExprCnt uint64
|
|
// entrypoint for the parser
|
|
entrypoint string
|
|
|
|
allowInvalidUTF8 bool
|
|
|
|
*Stats
|
|
|
|
choiceNoMatch string
|
|
// recovery expression stack, keeps track of the currently available recovery expression, these are traversed in reverse
|
|
recoveryStack []map[string]any
|
|
}
|
|
|
|
// push a variable set on the vstack.
|
|
func (p *parser) pushV() {
|
|
if cap(p.vstack) == len(p.vstack) {
|
|
// create new empty slot in the stack
|
|
p.vstack = append(p.vstack, nil)
|
|
} else {
|
|
// slice to 1 more
|
|
p.vstack = p.vstack[:len(p.vstack)+1]
|
|
}
|
|
|
|
// get the last args set
|
|
m := p.vstack[len(p.vstack)-1]
|
|
if m != nil && len(m) == 0 {
|
|
// empty map, all good
|
|
return
|
|
}
|
|
|
|
m = make(map[string]any)
|
|
p.vstack[len(p.vstack)-1] = m
|
|
}
|
|
|
|
// pop a variable set from the vstack.
|
|
func (p *parser) popV() {
|
|
// if the map is not empty, clear it
|
|
m := p.vstack[len(p.vstack)-1]
|
|
if len(m) > 0 {
|
|
// GC that map
|
|
p.vstack[len(p.vstack)-1] = nil
|
|
}
|
|
p.vstack = p.vstack[:len(p.vstack)-1]
|
|
}
|
|
|
|
// push a recovery expression with its labels to the recoveryStack
|
|
func (p *parser) pushRecovery(labels []string, expr any) {
|
|
if cap(p.recoveryStack) == len(p.recoveryStack) {
|
|
// create new empty slot in the stack
|
|
p.recoveryStack = append(p.recoveryStack, nil)
|
|
} else {
|
|
// slice to 1 more
|
|
p.recoveryStack = p.recoveryStack[:len(p.recoveryStack)+1]
|
|
}
|
|
|
|
m := make(map[string]any, len(labels))
|
|
for _, fl := range labels {
|
|
m[fl] = expr
|
|
}
|
|
p.recoveryStack[len(p.recoveryStack)-1] = m
|
|
}
|
|
|
|
// pop a recovery expression from the recoveryStack
|
|
func (p *parser) popRecovery() {
|
|
// GC that map
|
|
p.recoveryStack[len(p.recoveryStack)-1] = nil
|
|
|
|
p.recoveryStack = p.recoveryStack[:len(p.recoveryStack)-1]
|
|
}
|
|
|
|
func (p *parser) print(prefix, s string) string {
|
|
if !p.debug {
|
|
return s
|
|
}
|
|
|
|
fmt.Printf("%s %d:%d:%d: %s [%#U]\n",
|
|
prefix, p.pt.line, p.pt.col, p.pt.offset, s, p.pt.rn)
|
|
return s
|
|
}
|
|
|
|
func (p *parser) printIndent(mark string, s string) string {
|
|
return p.print(strings.Repeat(" ", p.depth)+mark, s)
|
|
}
|
|
|
|
func (p *parser) in(s string) string {
|
|
res := p.printIndent(">", s)
|
|
p.depth++
|
|
return res
|
|
}
|
|
|
|
func (p *parser) out(s string) string {
|
|
p.depth--
|
|
return p.printIndent("<", s)
|
|
}
|
|
|
|
func (p *parser) addErr(err error) {
|
|
p.addErrAt(err, p.pt.position, []string{})
|
|
}
|
|
|
|
func (p *parser) addErrAt(err error, pos position, expected []string) {
|
|
var buf bytes.Buffer
|
|
if p.filename != "" {
|
|
buf.WriteString(p.filename)
|
|
}
|
|
if buf.Len() > 0 {
|
|
buf.WriteString(":")
|
|
}
|
|
buf.WriteString(fmt.Sprintf("%d:%d (%d)", pos.line, pos.col, pos.offset))
|
|
if len(p.rstack) > 0 {
|
|
if buf.Len() > 0 {
|
|
buf.WriteString(": ")
|
|
}
|
|
rule := p.rstack[len(p.rstack)-1]
|
|
if rule.displayName != "" {
|
|
buf.WriteString("rule " + rule.displayName)
|
|
} else {
|
|
buf.WriteString("rule " + rule.name)
|
|
}
|
|
}
|
|
pe := &parserError{Inner: err, pos: pos, prefix: buf.String(), expected: expected}
|
|
p.errs.add(pe)
|
|
}
|
|
|
|
func (p *parser) failAt(fail bool, pos position, want string) {
|
|
// process fail if parsing fails and not inverted or parsing succeeds and invert is set
|
|
if fail == p.maxFailInvertExpected {
|
|
if pos.offset < p.maxFailPos.offset {
|
|
return
|
|
}
|
|
|
|
if pos.offset > p.maxFailPos.offset {
|
|
p.maxFailPos = pos
|
|
p.maxFailExpected = p.maxFailExpected[:0]
|
|
}
|
|
|
|
if p.maxFailInvertExpected {
|
|
want = "!" + want
|
|
}
|
|
p.maxFailExpected = append(p.maxFailExpected, want)
|
|
}
|
|
}
|
|
|
|
// read advances the parser to the next rune.
|
|
func (p *parser) read() {
|
|
p.pt.offset += p.pt.w
|
|
rn, n := utf8.DecodeRune(p.data[p.pt.offset:])
|
|
p.pt.rn = rn
|
|
p.pt.w = n
|
|
p.pt.col++
|
|
if rn == '\n' {
|
|
p.pt.line++
|
|
p.pt.col = 0
|
|
}
|
|
|
|
if rn == utf8.RuneError && n == 1 { // see utf8.DecodeRune
|
|
if !p.allowInvalidUTF8 {
|
|
p.addErr(errInvalidEncoding)
|
|
}
|
|
}
|
|
}
|
|
|
|
// restore parser position to the savepoint pt.
|
|
func (p *parser) restore(pt savepoint) {
|
|
if p.debug {
|
|
defer p.out(p.in("restore"))
|
|
}
|
|
if pt.offset == p.pt.offset {
|
|
return
|
|
}
|
|
p.pt = pt
|
|
}
|
|
|
|
// Cloner is implemented by any value that has a Clone method, which returns a
|
|
// copy of the value. This is mainly used for types which are not passed by
|
|
// value (e.g map, slice, chan) or structs that contain such types.
|
|
//
|
|
// This is used in conjunction with the global state feature to create proper
|
|
// copies of the state to allow the parser to properly restore the state in
|
|
// the case of backtracking.
|
|
type Cloner interface {
|
|
Clone() any
|
|
}
|
|
|
|
var statePool = &sync.Pool{
|
|
New: func() any { return make(storeDict) },
|
|
}
|
|
|
|
func (sd storeDict) Discard() {
|
|
for k := range sd {
|
|
delete(sd, k)
|
|
}
|
|
statePool.Put(sd)
|
|
}
|
|
|
|
// clone and return parser current state.
|
|
func (p *parser) cloneState() storeDict {
|
|
if p.debug {
|
|
defer p.out(p.in("cloneState"))
|
|
}
|
|
|
|
state := statePool.Get().(storeDict)
|
|
for k, v := range p.cur.state {
|
|
if c, ok := v.(Cloner); ok {
|
|
state[k] = c.Clone()
|
|
} else {
|
|
state[k] = v
|
|
}
|
|
}
|
|
return state
|
|
}
|
|
|
|
// restore parser current state to the state storeDict.
|
|
// every restoreState should applied only one time for every cloned state
|
|
func (p *parser) restoreState(state storeDict) {
|
|
if p.debug {
|
|
defer p.out(p.in("restoreState"))
|
|
}
|
|
p.cur.state.Discard()
|
|
p.cur.state = state
|
|
}
|
|
|
|
// get the slice of bytes from the savepoint start to the current position.
|
|
func (p *parser) sliceFrom(start savepoint) []byte {
|
|
return p.data[start.position.offset:p.pt.position.offset]
|
|
}
|
|
|
|
func (p *parser) getMemoized(node any) (resultTuple, bool) {
|
|
if len(p.memo) == 0 {
|
|
return resultTuple{}, false
|
|
}
|
|
m := p.memo[p.pt.offset]
|
|
if len(m) == 0 {
|
|
return resultTuple{}, false
|
|
}
|
|
res, ok := m[node]
|
|
return res, ok
|
|
}
|
|
|
|
func (p *parser) setMemoized(pt savepoint, node any, tuple resultTuple) {
|
|
if p.memo == nil {
|
|
p.memo = make(map[int]map[any]resultTuple)
|
|
}
|
|
m := p.memo[pt.offset]
|
|
if m == nil {
|
|
m = make(map[any]resultTuple)
|
|
p.memo[pt.offset] = m
|
|
}
|
|
m[node] = tuple
|
|
}
|
|
|
|
func (p *parser) buildRulesTable(g *grammar) {
|
|
p.rules = make(map[string]*rule, len(g.rules))
|
|
for _, r := range g.rules {
|
|
p.rules[r.name] = r
|
|
}
|
|
}
|
|
|
|
func (p *parser) parse(g *grammar) (val any, err error) {
|
|
if len(g.rules) == 0 {
|
|
p.addErr(errNoRule)
|
|
return nil, p.errs.err()
|
|
}
|
|
|
|
// TODO : not super critical but this could be generated
|
|
p.buildRulesTable(g)
|
|
|
|
if p.recover {
|
|
// panic can be used in action code to stop parsing immediately
|
|
// and return the panic as an error.
|
|
defer func() {
|
|
if e := recover(); e != nil {
|
|
if p.debug {
|
|
defer p.out(p.in("panic handler"))
|
|
}
|
|
val = nil
|
|
switch e := e.(type) {
|
|
case error:
|
|
p.addErr(e)
|
|
default:
|
|
p.addErr(fmt.Errorf("%v", e))
|
|
}
|
|
err = p.errs.err()
|
|
}
|
|
}()
|
|
}
|
|
|
|
startRule, ok := p.rules[p.entrypoint]
|
|
if !ok {
|
|
p.addErr(errInvalidEntrypoint)
|
|
return nil, p.errs.err()
|
|
}
|
|
|
|
p.read() // advance to first rune
|
|
val, ok = p.parseRuleWrap(startRule)
|
|
if !ok {
|
|
if len(*p.errs) == 0 {
|
|
// If parsing fails, but no errors have been recorded, the expected values
|
|
// for the farthest parser position are returned as error.
|
|
maxFailExpectedMap := make(map[string]struct{}, len(p.maxFailExpected))
|
|
for _, v := range p.maxFailExpected {
|
|
maxFailExpectedMap[v] = struct{}{}
|
|
}
|
|
expected := make([]string, 0, len(maxFailExpectedMap))
|
|
eof := false
|
|
if _, ok := maxFailExpectedMap["!."]; ok {
|
|
delete(maxFailExpectedMap, "!.")
|
|
eof = true
|
|
}
|
|
for k := range maxFailExpectedMap {
|
|
expected = append(expected, k)
|
|
}
|
|
sort.Strings(expected)
|
|
if eof {
|
|
expected = append(expected, "EOF")
|
|
}
|
|
p.addErrAt(errors.New("no match found, expected: "+listJoin(expected, ", ", "or")), p.maxFailPos, expected)
|
|
}
|
|
|
|
return nil, p.errs.err()
|
|
}
|
|
return val, p.errs.err()
|
|
}
|
|
|
|
func listJoin(list []string, sep string, lastSep string) string {
|
|
switch len(list) {
|
|
case 0:
|
|
return ""
|
|
case 1:
|
|
return list[0]
|
|
default:
|
|
return strings.Join(list[:len(list)-1], sep) + " " + lastSep + " " + list[len(list)-1]
|
|
}
|
|
}
|
|
|
|
func (p *parser) parseRuleMemoize(rule *rule) (any, bool) {
|
|
res, ok := p.getMemoized(rule)
|
|
if ok {
|
|
p.restore(res.end)
|
|
return res.v, res.b
|
|
}
|
|
|
|
startMark := p.pt
|
|
val, ok := p.parseRule(rule)
|
|
p.setMemoized(startMark, rule, resultTuple{val, ok, p.pt})
|
|
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseRuleWrap(rule *rule) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseRule " + rule.name))
|
|
}
|
|
var (
|
|
val any
|
|
ok bool
|
|
startMark = p.pt
|
|
)
|
|
|
|
if p.memoize {
|
|
val, ok = p.parseRuleMemoize(rule)
|
|
} else {
|
|
val, ok = p.parseRule(rule)
|
|
}
|
|
|
|
if ok && p.debug {
|
|
p.printIndent("MATCH", string(p.sliceFrom(startMark)))
|
|
}
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseRule(rule *rule) (any, bool) {
|
|
p.rstack = append(p.rstack, rule)
|
|
p.pushV()
|
|
val, ok := p.parseExprWrap(rule.expr)
|
|
p.popV()
|
|
p.rstack = p.rstack[:len(p.rstack)-1]
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseExprWrap(expr any) (any, bool) {
|
|
var pt savepoint
|
|
|
|
if p.memoize {
|
|
res, ok := p.getMemoized(expr)
|
|
if ok {
|
|
p.restore(res.end)
|
|
return res.v, res.b
|
|
}
|
|
pt = p.pt
|
|
}
|
|
|
|
val, ok := p.parseExpr(expr)
|
|
|
|
if p.memoize {
|
|
p.setMemoized(pt, expr, resultTuple{val, ok, p.pt})
|
|
}
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseExpr(expr any) (any, bool) {
|
|
p.ExprCnt++
|
|
if p.ExprCnt > p.maxExprCnt {
|
|
panic(errMaxExprCnt)
|
|
}
|
|
|
|
var val any
|
|
var ok bool
|
|
switch expr := expr.(type) {
|
|
case *actionExpr:
|
|
val, ok = p.parseActionExpr(expr)
|
|
case *andCodeExpr:
|
|
val, ok = p.parseAndCodeExpr(expr)
|
|
case *andExpr:
|
|
val, ok = p.parseAndExpr(expr)
|
|
case *anyMatcher:
|
|
val, ok = p.parseAnyMatcher(expr)
|
|
case *charClassMatcher:
|
|
val, ok = p.parseCharClassMatcher(expr)
|
|
case *choiceExpr:
|
|
val, ok = p.parseChoiceExpr(expr)
|
|
case *labeledExpr:
|
|
val, ok = p.parseLabeledExpr(expr)
|
|
case *litMatcher:
|
|
val, ok = p.parseLitMatcher(expr)
|
|
case *notCodeExpr:
|
|
val, ok = p.parseNotCodeExpr(expr)
|
|
case *notExpr:
|
|
val, ok = p.parseNotExpr(expr)
|
|
case *oneOrMoreExpr:
|
|
val, ok = p.parseOneOrMoreExpr(expr)
|
|
case *recoveryExpr:
|
|
val, ok = p.parseRecoveryExpr(expr)
|
|
case *ruleRefExpr:
|
|
val, ok = p.parseRuleRefExpr(expr)
|
|
case *seqExpr:
|
|
val, ok = p.parseSeqExpr(expr)
|
|
case *stateCodeExpr:
|
|
val, ok = p.parseStateCodeExpr(expr)
|
|
case *throwExpr:
|
|
val, ok = p.parseThrowExpr(expr)
|
|
case *zeroOrMoreExpr:
|
|
val, ok = p.parseZeroOrMoreExpr(expr)
|
|
case *zeroOrOneExpr:
|
|
val, ok = p.parseZeroOrOneExpr(expr)
|
|
default:
|
|
panic(fmt.Sprintf("unknown expression type %T", expr))
|
|
}
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseActionExpr(act *actionExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseActionExpr"))
|
|
}
|
|
|
|
start := p.pt
|
|
val, ok := p.parseExprWrap(act.expr)
|
|
if ok {
|
|
p.cur.pos = start.position
|
|
p.cur.text = p.sliceFrom(start)
|
|
state := p.cloneState()
|
|
actVal, err := act.run(p)
|
|
if err != nil {
|
|
p.addErrAt(err, start.position, []string{})
|
|
}
|
|
p.restoreState(state)
|
|
|
|
val = actVal
|
|
}
|
|
if ok && p.debug {
|
|
p.printIndent("MATCH", string(p.sliceFrom(start)))
|
|
}
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseAndCodeExpr(and *andCodeExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseAndCodeExpr"))
|
|
}
|
|
|
|
state := p.cloneState()
|
|
|
|
ok, err := and.run(p)
|
|
if err != nil {
|
|
p.addErr(err)
|
|
}
|
|
p.restoreState(state)
|
|
|
|
return nil, ok
|
|
}
|
|
|
|
func (p *parser) parseAndExpr(and *andExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseAndExpr"))
|
|
}
|
|
|
|
pt := p.pt
|
|
state := p.cloneState()
|
|
p.pushV()
|
|
_, ok := p.parseExprWrap(and.expr)
|
|
p.popV()
|
|
p.restoreState(state)
|
|
p.restore(pt)
|
|
|
|
return nil, ok
|
|
}
|
|
|
|
func (p *parser) parseAnyMatcher(any *anyMatcher) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseAnyMatcher"))
|
|
}
|
|
|
|
if p.pt.rn == utf8.RuneError && p.pt.w == 0 {
|
|
// EOF - see utf8.DecodeRune
|
|
p.failAt(false, p.pt.position, ".")
|
|
return nil, false
|
|
}
|
|
start := p.pt
|
|
p.read()
|
|
p.failAt(true, start.position, ".")
|
|
return p.sliceFrom(start), true
|
|
}
|
|
|
|
func (p *parser) parseCharClassMatcher(chr *charClassMatcher) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseCharClassMatcher"))
|
|
}
|
|
|
|
cur := p.pt.rn
|
|
start := p.pt
|
|
|
|
// can't match EOF
|
|
if cur == utf8.RuneError && p.pt.w == 0 { // see utf8.DecodeRune
|
|
p.failAt(false, start.position, chr.val)
|
|
return nil, false
|
|
}
|
|
|
|
if chr.ignoreCase {
|
|
cur = unicode.ToLower(cur)
|
|
}
|
|
|
|
// try to match in the list of available chars
|
|
for _, rn := range chr.chars {
|
|
if rn == cur {
|
|
if chr.inverted {
|
|
p.failAt(false, start.position, chr.val)
|
|
return nil, false
|
|
}
|
|
p.read()
|
|
p.failAt(true, start.position, chr.val)
|
|
return p.sliceFrom(start), true
|
|
}
|
|
}
|
|
|
|
// try to match in the list of ranges
|
|
for i := 0; i < len(chr.ranges); i += 2 {
|
|
if cur >= chr.ranges[i] && cur <= chr.ranges[i+1] {
|
|
if chr.inverted {
|
|
p.failAt(false, start.position, chr.val)
|
|
return nil, false
|
|
}
|
|
p.read()
|
|
p.failAt(true, start.position, chr.val)
|
|
return p.sliceFrom(start), true
|
|
}
|
|
}
|
|
|
|
// try to match in the list of Unicode classes
|
|
for _, cl := range chr.classes {
|
|
if unicode.Is(cl, cur) {
|
|
if chr.inverted {
|
|
p.failAt(false, start.position, chr.val)
|
|
return nil, false
|
|
}
|
|
p.read()
|
|
p.failAt(true, start.position, chr.val)
|
|
return p.sliceFrom(start), true
|
|
}
|
|
}
|
|
|
|
if chr.inverted {
|
|
p.read()
|
|
p.failAt(true, start.position, chr.val)
|
|
return p.sliceFrom(start), true
|
|
}
|
|
p.failAt(false, start.position, chr.val)
|
|
return nil, false
|
|
}
|
|
|
|
func (p *parser) incChoiceAltCnt(ch *choiceExpr, altI int) {
|
|
choiceIdent := fmt.Sprintf("%s %d:%d", p.rstack[len(p.rstack)-1].name, ch.pos.line, ch.pos.col)
|
|
m := p.ChoiceAltCnt[choiceIdent]
|
|
if m == nil {
|
|
m = make(map[string]int)
|
|
p.ChoiceAltCnt[choiceIdent] = m
|
|
}
|
|
// We increment altI by 1, so the keys do not start at 0
|
|
alt := strconv.Itoa(altI + 1)
|
|
if altI == choiceNoMatch {
|
|
alt = p.choiceNoMatch
|
|
}
|
|
m[alt]++
|
|
}
|
|
|
|
func (p *parser) parseChoiceExpr(ch *choiceExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseChoiceExpr"))
|
|
}
|
|
|
|
for altI, alt := range ch.alternatives {
|
|
// dummy assignment to prevent compile error if optimized
|
|
_ = altI
|
|
|
|
state := p.cloneState()
|
|
|
|
p.pushV()
|
|
val, ok := p.parseExprWrap(alt)
|
|
p.popV()
|
|
if ok {
|
|
p.incChoiceAltCnt(ch, altI)
|
|
return val, ok
|
|
}
|
|
p.restoreState(state)
|
|
}
|
|
p.incChoiceAltCnt(ch, choiceNoMatch)
|
|
return nil, false
|
|
}
|
|
|
|
func (p *parser) parseLabeledExpr(lab *labeledExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseLabeledExpr"))
|
|
}
|
|
|
|
p.pushV()
|
|
val, ok := p.parseExprWrap(lab.expr)
|
|
p.popV()
|
|
if ok && lab.label != "" {
|
|
m := p.vstack[len(p.vstack)-1]
|
|
m[lab.label] = val
|
|
}
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseLitMatcher(lit *litMatcher) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseLitMatcher"))
|
|
}
|
|
|
|
start := p.pt
|
|
for _, want := range lit.val {
|
|
cur := p.pt.rn
|
|
if lit.ignoreCase {
|
|
cur = unicode.ToLower(cur)
|
|
}
|
|
if cur != want {
|
|
p.failAt(false, start.position, lit.want)
|
|
p.restore(start)
|
|
return nil, false
|
|
}
|
|
p.read()
|
|
}
|
|
p.failAt(true, start.position, lit.want)
|
|
return p.sliceFrom(start), true
|
|
}
|
|
|
|
func (p *parser) parseNotCodeExpr(not *notCodeExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseNotCodeExpr"))
|
|
}
|
|
|
|
state := p.cloneState()
|
|
|
|
ok, err := not.run(p)
|
|
if err != nil {
|
|
p.addErr(err)
|
|
}
|
|
p.restoreState(state)
|
|
|
|
return nil, !ok
|
|
}
|
|
|
|
func (p *parser) parseNotExpr(not *notExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseNotExpr"))
|
|
}
|
|
|
|
pt := p.pt
|
|
state := p.cloneState()
|
|
p.pushV()
|
|
p.maxFailInvertExpected = !p.maxFailInvertExpected
|
|
_, ok := p.parseExprWrap(not.expr)
|
|
p.maxFailInvertExpected = !p.maxFailInvertExpected
|
|
p.popV()
|
|
p.restoreState(state)
|
|
p.restore(pt)
|
|
|
|
return nil, !ok
|
|
}
|
|
|
|
func (p *parser) parseOneOrMoreExpr(expr *oneOrMoreExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseOneOrMoreExpr"))
|
|
}
|
|
|
|
var vals []any
|
|
|
|
for {
|
|
p.pushV()
|
|
val, ok := p.parseExprWrap(expr.expr)
|
|
p.popV()
|
|
if !ok {
|
|
if len(vals) == 0 {
|
|
// did not match once, no match
|
|
return nil, false
|
|
}
|
|
return vals, true
|
|
}
|
|
vals = append(vals, val)
|
|
}
|
|
}
|
|
|
|
func (p *parser) parseRecoveryExpr(recover *recoveryExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseRecoveryExpr (" + strings.Join(recover.failureLabel, ",") + ")"))
|
|
}
|
|
|
|
p.pushRecovery(recover.failureLabel, recover.recoverExpr)
|
|
val, ok := p.parseExprWrap(recover.expr)
|
|
p.popRecovery()
|
|
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseRuleRefExpr(ref *ruleRefExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseRuleRefExpr " + ref.name))
|
|
}
|
|
|
|
if ref.name == "" {
|
|
panic(fmt.Sprintf("%s: invalid rule: missing name", ref.pos))
|
|
}
|
|
|
|
rule := p.rules[ref.name]
|
|
if rule == nil {
|
|
p.addErr(fmt.Errorf("undefined rule: %s", ref.name))
|
|
return nil, false
|
|
}
|
|
return p.parseRuleWrap(rule)
|
|
}
|
|
|
|
func (p *parser) parseSeqExpr(seq *seqExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseSeqExpr"))
|
|
}
|
|
|
|
vals := make([]any, 0, len(seq.exprs))
|
|
|
|
pt := p.pt
|
|
state := p.cloneState()
|
|
for _, expr := range seq.exprs {
|
|
val, ok := p.parseExprWrap(expr)
|
|
if !ok {
|
|
p.restoreState(state)
|
|
p.restore(pt)
|
|
return nil, false
|
|
}
|
|
vals = append(vals, val)
|
|
}
|
|
return vals, true
|
|
}
|
|
|
|
func (p *parser) parseStateCodeExpr(state *stateCodeExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseStateCodeExpr"))
|
|
}
|
|
|
|
err := state.run(p)
|
|
if err != nil {
|
|
p.addErr(err)
|
|
}
|
|
return nil, true
|
|
}
|
|
|
|
func (p *parser) parseThrowExpr(expr *throwExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseThrowExpr"))
|
|
}
|
|
|
|
for i := len(p.recoveryStack) - 1; i >= 0; i-- {
|
|
if recoverExpr, ok := p.recoveryStack[i][expr.label]; ok {
|
|
if val, ok := p.parseExprWrap(recoverExpr); ok {
|
|
return val, ok
|
|
}
|
|
}
|
|
}
|
|
|
|
return nil, false
|
|
}
|
|
|
|
func (p *parser) parseZeroOrMoreExpr(expr *zeroOrMoreExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseZeroOrMoreExpr"))
|
|
}
|
|
|
|
var vals []any
|
|
|
|
for {
|
|
p.pushV()
|
|
val, ok := p.parseExprWrap(expr.expr)
|
|
p.popV()
|
|
if !ok {
|
|
return vals, true
|
|
}
|
|
vals = append(vals, val)
|
|
}
|
|
}
|
|
|
|
func (p *parser) parseZeroOrOneExpr(expr *zeroOrOneExpr) (any, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseZeroOrOneExpr"))
|
|
}
|
|
|
|
p.pushV()
|
|
val, _ := p.parseExprWrap(expr.expr)
|
|
p.popV()
|
|
// whether it matched or not, consider it a match
|
|
return val, true
|
|
}
|