mirror of
https://github.com/dolthub/dolt.git
synced 2026-05-05 02:45:34 -05:00
Mike Gray
2207 lines
53 KiB
Go
2207 lines
53 KiB
Go
package pkg
|
|
|
|
import (
|
|
"bytes"
|
|
"errors"
|
|
"fmt"
|
|
"io"
|
|
"io/ioutil"
|
|
"os"
|
|
"strings"
|
|
"unicode"
|
|
"unicode/utf8"
|
|
|
|
"github.com/attic-labs/noms/types"
|
|
)
|
|
|
|
type alias struct {
|
|
Name string
|
|
Target string
|
|
}
|
|
|
|
type namespaceIdent struct {
|
|
Namespace string
|
|
ID string
|
|
}
|
|
|
|
var g = &grammar{
|
|
rules: []*rule{
|
|
{
|
|
name: "Package",
|
|
pos: position{line: 15, col: 1, offset: 131},
|
|
expr: &actionExpr{
|
|
pos: position{line: 15, col: 12, offset: 142},
|
|
run: (*parser).callonPackage1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 15, col: 12, offset: 142},
|
|
exprs: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 15, col: 12, offset: 142},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 15, col: 14, offset: 144},
|
|
label: "dd",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 15, col: 17, offset: 147},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 15, col: 17, offset: 147},
|
|
name: "Definition",
|
|
},
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 15, col: 29, offset: 159},
|
|
name: "_",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 15, col: 31, offset: 161},
|
|
name: "EOF",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Definition",
|
|
pos: position{line: 57, col: 1, offset: 1323},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 57, col: 15, offset: 1337},
|
|
alternatives: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 57, col: 15, offset: 1337},
|
|
name: "Struct",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 57, col: 24, offset: 1346},
|
|
name: "Using",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 57, col: 32, offset: 1354},
|
|
name: "Alias",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Alias",
|
|
pos: position{line: 59, col: 1, offset: 1361},
|
|
expr: &actionExpr{
|
|
pos: position{line: 59, col: 10, offset: 1370},
|
|
run: (*parser).callonAlias1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 59, col: 10, offset: 1370},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 59, col: 10, offset: 1370},
|
|
val: "alias",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 59, col: 18, offset: 1378},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 59, col: 20, offset: 1380},
|
|
label: "i",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 59, col: 22, offset: 1382},
|
|
name: "Ident",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 59, col: 28, offset: 1388},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 59, col: 30, offset: 1390},
|
|
val: "=",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 59, col: 34, offset: 1394},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 59, col: 36, offset: 1396},
|
|
val: "import",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 59, col: 45, offset: 1405},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 59, col: 47, offset: 1407},
|
|
label: "q",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 59, col: 49, offset: 1409},
|
|
name: "QuotedString",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 59, col: 62, offset: 1422},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Using",
|
|
pos: position{line: 63, col: 1, offset: 1472},
|
|
expr: &actionExpr{
|
|
pos: position{line: 63, col: 10, offset: 1481},
|
|
run: (*parser).callonUsing1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 63, col: 10, offset: 1481},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 63, col: 10, offset: 1481},
|
|
val: "using",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 63, col: 18, offset: 1489},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 63, col: 20, offset: 1491},
|
|
label: "ct",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 63, col: 23, offset: 1494},
|
|
name: "CompoundType",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 63, col: 36, offset: 1507},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Struct",
|
|
pos: position{line: 68, col: 1, offset: 1531},
|
|
expr: &actionExpr{
|
|
pos: position{line: 68, col: 11, offset: 1541},
|
|
run: (*parser).callonStruct1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 68, col: 11, offset: 1541},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 68, col: 11, offset: 1541},
|
|
val: "struct",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 68, col: 20, offset: 1550},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 68, col: 22, offset: 1552},
|
|
label: "i",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 68, col: 24, offset: 1554},
|
|
name: "Ident",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 68, col: 30, offset: 1560},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 68, col: 32, offset: 1562},
|
|
val: "{",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 68, col: 36, offset: 1566},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 68, col: 38, offset: 1568},
|
|
label: "l",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 68, col: 40, offset: 1570},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 68, col: 40, offset: 1570},
|
|
name: "StructEntry",
|
|
},
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 68, col: 53, offset: 1583},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 68, col: 55, offset: 1585},
|
|
val: "}",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 68, col: 59, offset: 1589},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "StructEntry",
|
|
pos: position{line: 93, col: 1, offset: 2269},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 93, col: 16, offset: 2284},
|
|
alternatives: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 93, col: 16, offset: 2284},
|
|
name: "Union",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 93, col: 24, offset: 2292},
|
|
name: "Field",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Union",
|
|
pos: position{line: 96, col: 1, offset: 2300},
|
|
expr: &actionExpr{
|
|
pos: position{line: 96, col: 10, offset: 2309},
|
|
run: (*parser).callonUnion1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 96, col: 10, offset: 2309},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 96, col: 10, offset: 2309},
|
|
val: "union",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 96, col: 18, offset: 2317},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 96, col: 20, offset: 2319},
|
|
val: "{",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 96, col: 24, offset: 2323},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 96, col: 26, offset: 2325},
|
|
label: "u",
|
|
expr: &oneOrMoreExpr{
|
|
pos: position{line: 96, col: 28, offset: 2327},
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 96, col: 28, offset: 2327},
|
|
name: "UnionField",
|
|
},
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 96, col: 40, offset: 2339},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 96, col: 42, offset: 2341},
|
|
val: "}",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 96, col: 46, offset: 2345},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Field",
|
|
pos: position{line: 111, col: 1, offset: 2679},
|
|
expr: &actionExpr{
|
|
pos: position{line: 111, col: 10, offset: 2688},
|
|
run: (*parser).callonField1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 111, col: 10, offset: 2688},
|
|
exprs: []interface{}{
|
|
&labeledExpr{
|
|
pos: position{line: 111, col: 10, offset: 2688},
|
|
label: "i",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 111, col: 12, offset: 2690},
|
|
name: "Ident",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 111, col: 18, offset: 2696},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 111, col: 20, offset: 2698},
|
|
val: ":",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 111, col: 24, offset: 2702},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 111, col: 26, offset: 2704},
|
|
label: "o",
|
|
expr: &zeroOrOneExpr{
|
|
pos: position{line: 111, col: 28, offset: 2706},
|
|
expr: &seqExpr{
|
|
pos: position{line: 111, col: 29, offset: 2707},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 111, col: 29, offset: 2707},
|
|
val: "optional",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 111, col: 40, offset: 2718},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 111, col: 44, offset: 2722},
|
|
label: "t",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 111, col: 46, offset: 2724},
|
|
name: "Type",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 111, col: 51, offset: 2729},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "UnionField",
|
|
pos: position{line: 115, col: 1, offset: 2800},
|
|
expr: &actionExpr{
|
|
pos: position{line: 115, col: 15, offset: 2814},
|
|
run: (*parser).callonUnionField1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 115, col: 15, offset: 2814},
|
|
exprs: []interface{}{
|
|
&labeledExpr{
|
|
pos: position{line: 115, col: 15, offset: 2814},
|
|
label: "i",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 115, col: 17, offset: 2816},
|
|
name: "Ident",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 115, col: 23, offset: 2822},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 115, col: 25, offset: 2824},
|
|
val: ":",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 115, col: 29, offset: 2828},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 115, col: 31, offset: 2830},
|
|
label: "t",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 115, col: 33, offset: 2832},
|
|
name: "Type",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 115, col: 38, offset: 2837},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Type",
|
|
pos: position{line: 119, col: 1, offset: 2905},
|
|
expr: &actionExpr{
|
|
pos: position{line: 119, col: 9, offset: 2913},
|
|
run: (*parser).callonType1,
|
|
expr: &labeledExpr{
|
|
pos: position{line: 119, col: 9, offset: 2913},
|
|
label: "t",
|
|
expr: &choiceExpr{
|
|
pos: position{line: 119, col: 12, offset: 2916},
|
|
alternatives: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 119, col: 12, offset: 2916},
|
|
name: "PrimitiveType",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 119, col: 28, offset: 2932},
|
|
name: "CompoundType",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 119, col: 43, offset: 2947},
|
|
name: "Union",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 119, col: 51, offset: 2955},
|
|
name: "NamespaceIdent",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "CompoundType",
|
|
pos: position{line: 132, col: 1, offset: 3274},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 132, col: 17, offset: 3290},
|
|
alternatives: []interface{}{
|
|
&actionExpr{
|
|
pos: position{line: 132, col: 17, offset: 3290},
|
|
run: (*parser).callonCompoundType2,
|
|
expr: &seqExpr{
|
|
pos: position{line: 132, col: 17, offset: 3290},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 132, col: 17, offset: 3290},
|
|
val: "List",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 132, col: 24, offset: 3297},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 132, col: 26, offset: 3299},
|
|
val: "<",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 132, col: 30, offset: 3303},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 132, col: 32, offset: 3305},
|
|
label: "t",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 132, col: 34, offset: 3307},
|
|
name: "Type",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 132, col: 39, offset: 3312},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 132, col: 41, offset: 3314},
|
|
val: ">",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 132, col: 45, offset: 3318},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&actionExpr{
|
|
pos: position{line: 134, col: 5, offset: 3395},
|
|
run: (*parser).callonCompoundType13,
|
|
expr: &seqExpr{
|
|
pos: position{line: 134, col: 5, offset: 3395},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 134, col: 5, offset: 3395},
|
|
val: "Map",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 134, col: 11, offset: 3401},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 134, col: 13, offset: 3403},
|
|
val: "<",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 134, col: 17, offset: 3407},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 134, col: 19, offset: 3409},
|
|
label: "k",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 134, col: 21, offset: 3411},
|
|
name: "Type",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 134, col: 26, offset: 3416},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 134, col: 28, offset: 3418},
|
|
val: ",",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 134, col: 32, offset: 3422},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 134, col: 34, offset: 3424},
|
|
label: "v",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 134, col: 36, offset: 3426},
|
|
name: "Type",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 134, col: 41, offset: 3431},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 134, col: 43, offset: 3433},
|
|
val: ">",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 134, col: 47, offset: 3437},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&actionExpr{
|
|
pos: position{line: 136, col: 5, offset: 3530},
|
|
run: (*parser).callonCompoundType29,
|
|
expr: &seqExpr{
|
|
pos: position{line: 136, col: 5, offset: 3530},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 136, col: 5, offset: 3530},
|
|
val: "Set",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 136, col: 11, offset: 3536},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 136, col: 13, offset: 3538},
|
|
val: "<",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 136, col: 17, offset: 3542},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 136, col: 19, offset: 3544},
|
|
label: "t",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 136, col: 21, offset: 3546},
|
|
name: "Type",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 136, col: 26, offset: 3551},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 136, col: 28, offset: 3553},
|
|
val: ">",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 136, col: 32, offset: 3557},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&actionExpr{
|
|
pos: position{line: 138, col: 5, offset: 3633},
|
|
run: (*parser).callonCompoundType40,
|
|
expr: &seqExpr{
|
|
pos: position{line: 138, col: 5, offset: 3633},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 138, col: 5, offset: 3633},
|
|
val: "Ref",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 138, col: 11, offset: 3639},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 138, col: 13, offset: 3641},
|
|
val: "<",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 138, col: 17, offset: 3645},
|
|
name: "_",
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 138, col: 19, offset: 3647},
|
|
label: "t",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 138, col: 21, offset: 3649},
|
|
name: "Type",
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 138, col: 26, offset: 3654},
|
|
name: "_",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 138, col: 28, offset: 3656},
|
|
val: ">",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 138, col: 32, offset: 3660},
|
|
name: "_",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "PrimitiveType",
|
|
pos: position{line: 142, col: 1, offset: 3735},
|
|
expr: &actionExpr{
|
|
pos: position{line: 142, col: 18, offset: 3752},
|
|
run: (*parser).callonPrimitiveType1,
|
|
expr: &labeledExpr{
|
|
pos: position{line: 142, col: 18, offset: 3752},
|
|
label: "p",
|
|
expr: &choiceExpr{
|
|
pos: position{line: 142, col: 21, offset: 3755},
|
|
alternatives: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 142, col: 103, offset: 3837},
|
|
val: "Number",
|
|
ignoreCase: false,
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 142, col: 127, offset: 3861},
|
|
val: "Bool",
|
|
ignoreCase: false,
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 142, col: 136, offset: 3870},
|
|
val: "String",
|
|
ignoreCase: false,
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 142, col: 147, offset: 3881},
|
|
val: "Blob",
|
|
ignoreCase: false,
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 142, col: 156, offset: 3890},
|
|
val: "Value",
|
|
ignoreCase: false,
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 142, col: 166, offset: 3900},
|
|
val: "Type",
|
|
ignoreCase: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "QuotedString",
|
|
pos: position{line: 146, col: 1, offset: 3979},
|
|
expr: &actionExpr{
|
|
pos: position{line: 146, col: 17, offset: 3995},
|
|
run: (*parser).callonQuotedString1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 146, col: 17, offset: 3995},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 146, col: 17, offset: 3995},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 146, col: 21, offset: 3999},
|
|
label: "n",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 146, col: 23, offset: 4001},
|
|
name: "String",
|
|
},
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 146, col: 30, offset: 4008},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "String",
|
|
pos: position{line: 150, col: 1, offset: 4041},
|
|
expr: &actionExpr{
|
|
pos: position{line: 150, col: 11, offset: 4051},
|
|
run: (*parser).callonString1,
|
|
expr: &choiceExpr{
|
|
pos: position{line: 150, col: 12, offset: 4052},
|
|
alternatives: []interface{}{
|
|
&seqExpr{
|
|
pos: position{line: 150, col: 12, offset: 4052},
|
|
exprs: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 150, col: 12, offset: 4052},
|
|
name: "StringPiece",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 150, col: 24, offset: 4064},
|
|
val: "\\\"",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 150, col: 29, offset: 4069},
|
|
name: "StringPiece",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 150, col: 41, offset: 4081},
|
|
val: "\\\"",
|
|
ignoreCase: false,
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 150, col: 46, offset: 4086},
|
|
name: "StringPiece",
|
|
},
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 150, col: 60, offset: 4100},
|
|
name: "StringPiece",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "StringPiece",
|
|
pos: position{line: 154, col: 1, offset: 4146},
|
|
expr: &zeroOrMoreExpr{
|
|
pos: position{line: 154, col: 16, offset: 4161},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 154, col: 17, offset: 4162},
|
|
alternatives: []interface{}{
|
|
&seqExpr{
|
|
pos: position{line: 154, col: 17, offset: 4162},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 154, col: 17, offset: 4162},
|
|
val: "\\",
|
|
ignoreCase: false,
|
|
},
|
|
¬Expr{
|
|
pos: position{line: 154, col: 21, offset: 4166},
|
|
expr: &litMatcher{
|
|
pos: position{line: 154, col: 22, offset: 4167},
|
|
val: "\"",
|
|
ignoreCase: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&charClassMatcher{
|
|
pos: position{line: 154, col: 28, offset: 4173},
|
|
val: "[^\"\\\\]",
|
|
chars: []rune{'"', '\\'},
|
|
ignoreCase: false,
|
|
inverted: true,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "NamespaceIdent",
|
|
pos: position{line: 156, col: 1, offset: 4183},
|
|
expr: &actionExpr{
|
|
pos: position{line: 156, col: 19, offset: 4201},
|
|
run: (*parser).callonNamespaceIdent1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 156, col: 19, offset: 4201},
|
|
exprs: []interface{}{
|
|
&labeledExpr{
|
|
pos: position{line: 156, col: 19, offset: 4201},
|
|
label: "n",
|
|
expr: &zeroOrMoreExpr{
|
|
pos: position{line: 156, col: 21, offset: 4203},
|
|
expr: &seqExpr{
|
|
pos: position{line: 156, col: 22, offset: 4204},
|
|
exprs: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 156, col: 22, offset: 4204},
|
|
name: "Ident",
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 156, col: 28, offset: 4210},
|
|
val: ".",
|
|
ignoreCase: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&labeledExpr{
|
|
pos: position{line: 156, col: 34, offset: 4216},
|
|
label: "id",
|
|
expr: &ruleRefExpr{
|
|
pos: position{line: 156, col: 37, offset: 4219},
|
|
name: "Ident",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Ident",
|
|
pos: position{line: 165, col: 1, offset: 4417},
|
|
expr: &actionExpr{
|
|
pos: position{line: 165, col: 10, offset: 4426},
|
|
run: (*parser).callonIdent1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 165, col: 10, offset: 4426},
|
|
exprs: []interface{}{
|
|
&charClassMatcher{
|
|
pos: position{line: 165, col: 10, offset: 4426},
|
|
val: "[\\pL_]",
|
|
chars: []rune{'_'},
|
|
classes: []*unicode.RangeTable{rangeTable("L")},
|
|
ignoreCase: false,
|
|
inverted: false,
|
|
},
|
|
&zeroOrMoreExpr{
|
|
pos: position{line: 165, col: 17, offset: 4433},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 165, col: 17, offset: 4433},
|
|
val: "[\\pL\\pN_]",
|
|
chars: []rune{'_'},
|
|
classes: []*unicode.RangeTable{rangeTable("L"), rangeTable("N")},
|
|
ignoreCase: false,
|
|
inverted: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "_",
|
|
displayName: "\"optional whitespace\"",
|
|
pos: position{line: 169, col: 1, offset: 4477},
|
|
expr: &actionExpr{
|
|
pos: position{line: 169, col: 28, offset: 4504},
|
|
run: (*parser).callon_1,
|
|
expr: &seqExpr{
|
|
pos: position{line: 169, col: 28, offset: 4504},
|
|
exprs: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 169, col: 28, offset: 4504},
|
|
name: "WS",
|
|
},
|
|
&zeroOrMoreExpr{
|
|
pos: position{line: 169, col: 31, offset: 4507},
|
|
expr: &seqExpr{
|
|
pos: position{line: 169, col: 32, offset: 4508},
|
|
exprs: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 169, col: 32, offset: 4508},
|
|
name: "Comment",
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 169, col: 40, offset: 4516},
|
|
name: "WS",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "WS",
|
|
pos: position{line: 173, col: 1, offset: 4543},
|
|
expr: &zeroOrMoreExpr{
|
|
pos: position{line: 173, col: 7, offset: 4549},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 173, col: 7, offset: 4549},
|
|
val: "[\\r\\n\\t\\pZ]",
|
|
chars: []rune{'\r', '\n', '\t'},
|
|
classes: []*unicode.RangeTable{rangeTable("Z")},
|
|
ignoreCase: false,
|
|
inverted: false,
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Comment",
|
|
pos: position{line: 175, col: 1, offset: 4563},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 175, col: 12, offset: 4574},
|
|
alternatives: []interface{}{
|
|
&seqExpr{
|
|
pos: position{line: 175, col: 12, offset: 4574},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 175, col: 12, offset: 4574},
|
|
val: "//",
|
|
ignoreCase: false,
|
|
},
|
|
&zeroOrMoreExpr{
|
|
pos: position{line: 175, col: 17, offset: 4579},
|
|
expr: &charClassMatcher{
|
|
pos: position{line: 175, col: 17, offset: 4579},
|
|
val: "[^\\n]",
|
|
chars: []rune{'\n'},
|
|
ignoreCase: false,
|
|
inverted: true,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&ruleRefExpr{
|
|
pos: position{line: 175, col: 26, offset: 4588},
|
|
name: "MultilineComment",
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "MultilineComment",
|
|
pos: position{line: 177, col: 1, offset: 4606},
|
|
expr: &seqExpr{
|
|
pos: position{line: 177, col: 21, offset: 4626},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 177, col: 21, offset: 4626},
|
|
val: "/*",
|
|
ignoreCase: false,
|
|
},
|
|
&zeroOrMoreExpr{
|
|
pos: position{line: 177, col: 26, offset: 4631},
|
|
expr: &choiceExpr{
|
|
pos: position{line: 177, col: 27, offset: 4632},
|
|
alternatives: []interface{}{
|
|
&seqExpr{
|
|
pos: position{line: 177, col: 27, offset: 4632},
|
|
exprs: []interface{}{
|
|
&litMatcher{
|
|
pos: position{line: 177, col: 27, offset: 4632},
|
|
val: "*",
|
|
ignoreCase: false,
|
|
},
|
|
¬Expr{
|
|
pos: position{line: 177, col: 31, offset: 4636},
|
|
expr: &litMatcher{
|
|
pos: position{line: 177, col: 32, offset: 4637},
|
|
val: "/",
|
|
ignoreCase: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&charClassMatcher{
|
|
pos: position{line: 177, col: 38, offset: 4643},
|
|
val: "[^*]",
|
|
chars: []rune{'*'},
|
|
ignoreCase: false,
|
|
inverted: true,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
&litMatcher{
|
|
pos: position{line: 177, col: 45, offset: 4650},
|
|
val: "*/",
|
|
ignoreCase: false,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "EOF",
|
|
pos: position{line: 179, col: 1, offset: 4656},
|
|
expr: &seqExpr{
|
|
pos: position{line: 179, col: 8, offset: 4663},
|
|
exprs: []interface{}{
|
|
&ruleRefExpr{
|
|
pos: position{line: 179, col: 8, offset: 4663},
|
|
name: "_",
|
|
},
|
|
¬Expr{
|
|
pos: position{line: 179, col: 10, offset: 4665},
|
|
expr: &anyMatcher{
|
|
line: 179, col: 11, offset: 4666,
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
}
|
|
|
|
func (c *current) onPackage1(dd interface{}) (interface{}, error) {
|
|
aliases := map[string]string{}
|
|
usings := []*types.Type{}
|
|
seenTypes := map[string]bool{}
|
|
orderedTypes := []*types.Type{}
|
|
for _, d := range dd.([]interface{}) {
|
|
switch d := d.(type) {
|
|
default:
|
|
return nil, fmt.Errorf("Unknown definition: %v", d)
|
|
case alias:
|
|
if _, present := aliases[d.Name]; present {
|
|
return nil, fmt.Errorf("Redefinition of " + d.Name)
|
|
}
|
|
aliases[d.Name] = d.Target
|
|
case *types.Type:
|
|
switch d.Kind() {
|
|
default:
|
|
return nil, fmt.Errorf("%v can't be defined at the top-level", d)
|
|
case types.ListKind, types.MapKind, types.RefKind, types.SetKind:
|
|
for _, u := range usings {
|
|
if u.Equals(d) {
|
|
return nil, fmt.Errorf("%v is a duplicate using declaration", d)
|
|
}
|
|
}
|
|
usings = append(usings, d)
|
|
case types.StructKind:
|
|
ds := expandStruct(d, len(orderedTypes))
|
|
for _, d := range ds {
|
|
if d.Name() != "" {
|
|
if seenTypes[d.Name()] {
|
|
return nil, fmt.Errorf("Redefinition of " + d.Name())
|
|
}
|
|
seenTypes[d.Name()] = true
|
|
}
|
|
orderedTypes = append(orderedTypes, d)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return intermediate{"", aliases, usings, orderedTypes}, nil
|
|
}
|
|
|
|
func (p *parser) callonPackage1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onPackage1(stack["dd"])
|
|
}
|
|
|
|
func (c *current) onAlias1(i, q interface{}) (interface{}, error) {
|
|
return alias{i.(string), q.(string)}, nil
|
|
}
|
|
|
|
func (p *parser) callonAlias1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onAlias1(stack["i"], stack["q"])
|
|
}
|
|
|
|
func (c *current) onUsing1(ct interface{}) (interface{}, error) {
|
|
return ct, nil
|
|
}
|
|
|
|
func (p *parser) callonUsing1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onUsing1(stack["ct"])
|
|
}
|
|
|
|
func (c *current) onStruct1(i, l interface{}) (interface{}, error) {
|
|
ll := l.([]interface{})
|
|
var u []types.Field
|
|
fieldNames := map[string]bool{}
|
|
fields := make([]types.Field, 0, len(ll))
|
|
for _, e := range ll {
|
|
switch e := e.(type) {
|
|
case []types.Field:
|
|
if u != nil {
|
|
return nil, fmt.Errorf("Only one anonymous union per struct.")
|
|
}
|
|
u = e
|
|
case types.Field:
|
|
if fieldNames[e.Name] {
|
|
return nil, fmt.Errorf("Redefinition of field %s in struct %s", e.Name, i.(string))
|
|
}
|
|
fieldNames[e.Name] = true
|
|
fields = append(fields, e)
|
|
default:
|
|
return nil, fmt.Errorf("Structs must be made up of field declarations and at most one anonymous union.")
|
|
}
|
|
}
|
|
return types.MakeStructType(i.(string), fields, u), nil
|
|
}
|
|
|
|
func (p *parser) callonStruct1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onStruct1(stack["i"], stack["l"])
|
|
}
|
|
|
|
func (c *current) onUnion1(u interface{}) (interface{}, error) {
|
|
uu := u.([]interface{})
|
|
choiceNames := map[string]bool{}
|
|
desc := make([]types.Field, 0, len(uu))
|
|
for _, f := range uu {
|
|
ff := f.(types.Field)
|
|
if choiceNames[ff.Name] {
|
|
return nil, fmt.Errorf("Redefinition of union choice %s", ff.Name)
|
|
}
|
|
choiceNames[ff.Name] = true
|
|
desc = append(desc, ff)
|
|
}
|
|
return desc, nil
|
|
}
|
|
|
|
func (p *parser) callonUnion1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onUnion1(stack["u"])
|
|
}
|
|
|
|
func (c *current) onField1(i, o, t interface{}) (interface{}, error) {
|
|
return types.Field{i.(string), t.(*types.Type), o != nil}, nil
|
|
}
|
|
|
|
func (p *parser) callonField1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onField1(stack["i"], stack["o"], stack["t"])
|
|
}
|
|
|
|
func (c *current) onUnionField1(i, t interface{}) (interface{}, error) {
|
|
return types.Field{i.(string), t.(*types.Type), false}, nil
|
|
}
|
|
|
|
func (p *parser) callonUnionField1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onUnionField1(stack["i"], stack["t"])
|
|
}
|
|
|
|
func (c *current) onType1(t interface{}) (interface{}, error) {
|
|
switch t := t.(type) {
|
|
case *types.Type:
|
|
return t, nil
|
|
case []types.Field:
|
|
return types.MakeStructType("", nil, t), nil
|
|
case namespaceIdent:
|
|
return types.MakeUnresolvedType(t.Namespace, t.ID), nil
|
|
default:
|
|
return nil, fmt.Errorf("%v is %T, not something that satisfies Type", t, t)
|
|
}
|
|
}
|
|
|
|
func (p *parser) callonType1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onType1(stack["t"])
|
|
}
|
|
|
|
func (c *current) onCompoundType2(t interface{}) (interface{}, error) {
|
|
return types.MakeListType(t.(*types.Type)), nil
|
|
}
|
|
|
|
func (p *parser) callonCompoundType2() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onCompoundType2(stack["t"])
|
|
}
|
|
|
|
func (c *current) onCompoundType13(k, v interface{}) (interface{}, error) {
|
|
return types.MakeMapType(k.(*types.Type), v.(*types.Type)), nil
|
|
}
|
|
|
|
func (p *parser) callonCompoundType13() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onCompoundType13(stack["k"], stack["v"])
|
|
}
|
|
|
|
func (c *current) onCompoundType29(t interface{}) (interface{}, error) {
|
|
return types.MakeSetType(t.(*types.Type)), nil
|
|
}
|
|
|
|
func (p *parser) callonCompoundType29() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onCompoundType29(stack["t"])
|
|
}
|
|
|
|
func (c *current) onCompoundType40(t interface{}) (interface{}, error) {
|
|
return types.MakeRefType(t.(*types.Type)), nil
|
|
}
|
|
|
|
func (p *parser) callonCompoundType40() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onCompoundType40(stack["t"])
|
|
}
|
|
|
|
func (c *current) onPrimitiveType1(p interface{}) (interface{}, error) {
|
|
return types.MakePrimitiveTypeByString(string(p.([]uint8))), nil
|
|
}
|
|
|
|
func (p *parser) callonPrimitiveType1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onPrimitiveType1(stack["p"])
|
|
}
|
|
|
|
func (c *current) onQuotedString1(n interface{}) (interface{}, error) {
|
|
return n.(string), nil
|
|
}
|
|
|
|
func (p *parser) callonQuotedString1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onQuotedString1(stack["n"])
|
|
}
|
|
|
|
func (c *current) onString1() (interface{}, error) {
|
|
return string(c.text), nil
|
|
}
|
|
|
|
func (p *parser) callonString1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onString1()
|
|
}
|
|
|
|
func (c *current) onNamespaceIdent1(n, id interface{}) (interface{}, error) {
|
|
nn := n.([]interface{})
|
|
ns := make([]string, len(nn))
|
|
for i, e := range nn {
|
|
ns[i] = e.([]interface{})[0].(string)
|
|
}
|
|
return namespaceIdent{strings.Join(ns, "."), id.(string)}, nil
|
|
}
|
|
|
|
func (p *parser) callonNamespaceIdent1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onNamespaceIdent1(stack["n"], stack["id"])
|
|
}
|
|
|
|
func (c *current) onIdent1() (interface{}, error) {
|
|
return string(c.text), nil
|
|
}
|
|
|
|
func (p *parser) callonIdent1() (interface{}, error) {
|
|
stack := p.vstack[len(p.vstack)-1]
|
|
_ = stack
|
|
return p.cur.onIdent1()
|
|
}
|
|
|
|
func (c *current) on_1() (interface{}, error) {
|
|
return nil, nil
|
|
}
|
|
|
|
func (p *parser) callon_1() (interface{}, 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")
|
|
|
|
// errInvalidEncoding is returned when the source is not properly
|
|
// utf8-encoded.
|
|
errInvalidEncoding = errors.New("invalid encoding")
|
|
|
|
// errNoMatch is returned if no match could be found.
|
|
errNoMatch = errors.New("no match found")
|
|
)
|
|
|
|
// 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
|
|
|
|
// 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)
|
|
}
|
|
}
|
|
|
|
// 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)
|
|
}
|
|
}
|
|
|
|
// ParseFile parses the file identified by filename.
|
|
func ParseFile(filename string, opts ...Option) (interface{}, error) {
|
|
f, err := os.Open(filename)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
defer f.Close()
|
|
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) (interface{}, error) {
|
|
b, err := ioutil.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) (interface{}, 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 fmt.Sprintf("%d:%d [%d]", p.line, p.col, 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
|
|
}
|
|
|
|
// the AST types...
|
|
|
|
type grammar struct {
|
|
pos position
|
|
rules []*rule
|
|
}
|
|
|
|
type rule struct {
|
|
pos position
|
|
name string
|
|
displayName string
|
|
expr interface{}
|
|
}
|
|
|
|
type choiceExpr struct {
|
|
pos position
|
|
alternatives []interface{}
|
|
}
|
|
|
|
type actionExpr struct {
|
|
pos position
|
|
expr interface{}
|
|
run func(*parser) (interface{}, error)
|
|
}
|
|
|
|
type seqExpr struct {
|
|
pos position
|
|
exprs []interface{}
|
|
}
|
|
|
|
type labeledExpr struct {
|
|
pos position
|
|
label string
|
|
expr interface{}
|
|
}
|
|
|
|
type expr struct {
|
|
pos position
|
|
expr interface{}
|
|
}
|
|
|
|
type andExpr expr
|
|
type notExpr expr
|
|
type zeroOrOneExpr expr
|
|
type zeroOrMoreExpr expr
|
|
type oneOrMoreExpr expr
|
|
|
|
type ruleRefExpr struct {
|
|
pos position
|
|
name string
|
|
}
|
|
|
|
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
|
|
}
|
|
|
|
type charClassMatcher struct {
|
|
pos position
|
|
val string
|
|
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
|
|
}
|
|
|
|
// 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 {
|
|
p := &parser{
|
|
filename: filename,
|
|
errs: new(errList),
|
|
data: b,
|
|
pt: savepoint{position: position{line: 1}},
|
|
recover: true,
|
|
}
|
|
p.setOptions(opts)
|
|
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 interface{}
|
|
b bool
|
|
end savepoint
|
|
}
|
|
|
|
type parser struct {
|
|
filename string
|
|
pt savepoint
|
|
cur current
|
|
|
|
data []byte
|
|
errs *errList
|
|
|
|
recover bool
|
|
debug bool
|
|
depth int
|
|
|
|
memoize bool
|
|
// memoization table for the packrat algorithm:
|
|
// map[offset in source] map[expression or rule] {value, match}
|
|
memo map[int]map[interface{}]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]interface{}
|
|
// rule stack, allows identification of the current rule in errors
|
|
rstack []*rule
|
|
|
|
// stats
|
|
exprCnt int
|
|
}
|
|
|
|
// 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]interface{})
|
|
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]
|
|
}
|
|
|
|
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) in(s string) string {
|
|
p.depth++
|
|
return p.print(strings.Repeat(" ", p.depth)+">", s)
|
|
}
|
|
|
|
func (p *parser) out(s string) string {
|
|
p.depth--
|
|
return p.print(strings.Repeat(" ", p.depth)+"<", s)
|
|
}
|
|
|
|
func (p *parser) addErr(err error) {
|
|
p.addErrAt(err, p.pt.position)
|
|
}
|
|
|
|
func (p *parser) addErrAt(err error, pos position) {
|
|
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, prefix: buf.String()}
|
|
p.errs.add(pe)
|
|
}
|
|
|
|
// 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 {
|
|
if n > 0 {
|
|
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
|
|
}
|
|
|
|
// 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 interface{}) (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 interface{}, tuple resultTuple) {
|
|
if p.memo == nil {
|
|
p.memo = make(map[int]map[interface{}]resultTuple)
|
|
}
|
|
m := p.memo[pt.offset]
|
|
if m == nil {
|
|
m = make(map[interface{}]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 interface{}, 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()
|
|
}
|
|
}()
|
|
}
|
|
|
|
// start rule is rule [0]
|
|
p.read() // advance to first rune
|
|
val, ok := p.parseRule(g.rules[0])
|
|
if !ok {
|
|
if len(*p.errs) == 0 {
|
|
// make sure this doesn't go out silently
|
|
p.addErr(errNoMatch)
|
|
}
|
|
return nil, p.errs.err()
|
|
}
|
|
return val, p.errs.err()
|
|
}
|
|
|
|
func (p *parser) parseRule(rule *rule) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseRule " + rule.name))
|
|
}
|
|
|
|
if p.memoize {
|
|
res, ok := p.getMemoized(rule)
|
|
if ok {
|
|
p.restore(res.end)
|
|
return res.v, res.b
|
|
}
|
|
}
|
|
|
|
start := p.pt
|
|
p.rstack = append(p.rstack, rule)
|
|
p.pushV()
|
|
val, ok := p.parseExpr(rule.expr)
|
|
p.popV()
|
|
p.rstack = p.rstack[:len(p.rstack)-1]
|
|
if ok && p.debug {
|
|
p.print(strings.Repeat(" ", p.depth)+"MATCH", string(p.sliceFrom(start)))
|
|
}
|
|
|
|
if p.memoize {
|
|
p.setMemoized(start, rule, resultTuple{val, ok, p.pt})
|
|
}
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseExpr(expr interface{}) (interface{}, bool) {
|
|
var pt savepoint
|
|
var ok bool
|
|
|
|
if p.memoize {
|
|
res, ok := p.getMemoized(expr)
|
|
if ok {
|
|
p.restore(res.end)
|
|
return res.v, res.b
|
|
}
|
|
pt = p.pt
|
|
}
|
|
|
|
p.exprCnt++
|
|
var val interface{}
|
|
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 *ruleRefExpr:
|
|
val, ok = p.parseRuleRefExpr(expr)
|
|
case *seqExpr:
|
|
val, ok = p.parseSeqExpr(expr)
|
|
case *zeroOrMoreExpr:
|
|
val, ok = p.parseZeroOrMoreExpr(expr)
|
|
case *zeroOrOneExpr:
|
|
val, ok = p.parseZeroOrOneExpr(expr)
|
|
default:
|
|
panic(fmt.Sprintf("unknown expression type %T", expr))
|
|
}
|
|
if p.memoize {
|
|
p.setMemoized(pt, expr, resultTuple{val, ok, p.pt})
|
|
}
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseActionExpr(act *actionExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseActionExpr"))
|
|
}
|
|
|
|
start := p.pt
|
|
val, ok := p.parseExpr(act.expr)
|
|
if ok {
|
|
p.cur.pos = start.position
|
|
p.cur.text = p.sliceFrom(start)
|
|
actVal, err := act.run(p)
|
|
if err != nil {
|
|
p.addErrAt(err, start.position)
|
|
}
|
|
val = actVal
|
|
}
|
|
if ok && p.debug {
|
|
p.print(strings.Repeat(" ", p.depth)+"MATCH", string(p.sliceFrom(start)))
|
|
}
|
|
return val, ok
|
|
}
|
|
|
|
func (p *parser) parseAndCodeExpr(and *andCodeExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseAndCodeExpr"))
|
|
}
|
|
|
|
ok, err := and.run(p)
|
|
if err != nil {
|
|
p.addErr(err)
|
|
}
|
|
return nil, ok
|
|
}
|
|
|
|
func (p *parser) parseAndExpr(and *andExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseAndExpr"))
|
|
}
|
|
|
|
pt := p.pt
|
|
p.pushV()
|
|
_, ok := p.parseExpr(and.expr)
|
|
p.popV()
|
|
p.restore(pt)
|
|
return nil, ok
|
|
}
|
|
|
|
func (p *parser) parseAnyMatcher(any *anyMatcher) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseAnyMatcher"))
|
|
}
|
|
|
|
if p.pt.rn != utf8.RuneError {
|
|
start := p.pt
|
|
p.read()
|
|
return p.sliceFrom(start), true
|
|
}
|
|
return nil, false
|
|
}
|
|
|
|
func (p *parser) parseCharClassMatcher(chr *charClassMatcher) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseCharClassMatcher"))
|
|
}
|
|
|
|
cur := p.pt.rn
|
|
// can't match EOF
|
|
if cur == utf8.RuneError {
|
|
return nil, false
|
|
}
|
|
start := p.pt
|
|
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 {
|
|
return nil, false
|
|
}
|
|
p.read()
|
|
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 {
|
|
return nil, false
|
|
}
|
|
p.read()
|
|
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 {
|
|
return nil, false
|
|
}
|
|
p.read()
|
|
return p.sliceFrom(start), true
|
|
}
|
|
}
|
|
|
|
if chr.inverted {
|
|
p.read()
|
|
return p.sliceFrom(start), true
|
|
}
|
|
return nil, false
|
|
}
|
|
|
|
func (p *parser) parseChoiceExpr(ch *choiceExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseChoiceExpr"))
|
|
}
|
|
|
|
for _, alt := range ch.alternatives {
|
|
p.pushV()
|
|
val, ok := p.parseExpr(alt)
|
|
p.popV()
|
|
if ok {
|
|
return val, ok
|
|
}
|
|
}
|
|
return nil, false
|
|
}
|
|
|
|
func (p *parser) parseLabeledExpr(lab *labeledExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseLabeledExpr"))
|
|
}
|
|
|
|
p.pushV()
|
|
val, ok := p.parseExpr(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) (interface{}, 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.restore(start)
|
|
return nil, false
|
|
}
|
|
p.read()
|
|
}
|
|
return p.sliceFrom(start), true
|
|
}
|
|
|
|
func (p *parser) parseNotCodeExpr(not *notCodeExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseNotCodeExpr"))
|
|
}
|
|
|
|
ok, err := not.run(p)
|
|
if err != nil {
|
|
p.addErr(err)
|
|
}
|
|
return nil, !ok
|
|
}
|
|
|
|
func (p *parser) parseNotExpr(not *notExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseNotExpr"))
|
|
}
|
|
|
|
pt := p.pt
|
|
p.pushV()
|
|
_, ok := p.parseExpr(not.expr)
|
|
p.popV()
|
|
p.restore(pt)
|
|
return nil, !ok
|
|
}
|
|
|
|
func (p *parser) parseOneOrMoreExpr(expr *oneOrMoreExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseOneOrMoreExpr"))
|
|
}
|
|
|
|
var vals []interface{}
|
|
|
|
for {
|
|
p.pushV()
|
|
val, ok := p.parseExpr(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) parseRuleRefExpr(ref *ruleRefExpr) (interface{}, 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.parseRule(rule)
|
|
}
|
|
|
|
func (p *parser) parseSeqExpr(seq *seqExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseSeqExpr"))
|
|
}
|
|
|
|
var vals []interface{}
|
|
|
|
pt := p.pt
|
|
for _, expr := range seq.exprs {
|
|
val, ok := p.parseExpr(expr)
|
|
if !ok {
|
|
p.restore(pt)
|
|
return nil, false
|
|
}
|
|
vals = append(vals, val)
|
|
}
|
|
return vals, true
|
|
}
|
|
|
|
func (p *parser) parseZeroOrMoreExpr(expr *zeroOrMoreExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseZeroOrMoreExpr"))
|
|
}
|
|
|
|
var vals []interface{}
|
|
|
|
for {
|
|
p.pushV()
|
|
val, ok := p.parseExpr(expr.expr)
|
|
p.popV()
|
|
if !ok {
|
|
return vals, true
|
|
}
|
|
vals = append(vals, val)
|
|
}
|
|
}
|
|
|
|
func (p *parser) parseZeroOrOneExpr(expr *zeroOrOneExpr) (interface{}, bool) {
|
|
if p.debug {
|
|
defer p.out(p.in("parseZeroOrOneExpr"))
|
|
}
|
|
|
|
p.pushV()
|
|
val, _ := p.parseExpr(expr.expr)
|
|
p.popV()
|
|
// whether it matched or not, consider it a match
|
|
return val, true
|
|
}
|
|
|
|
func rangeTable(class string) *unicode.RangeTable {
|
|
if rt, ok := unicode.Categories[class]; ok {
|
|
return rt
|
|
}
|
|
if rt, ok := unicode.Properties[class]; ok {
|
|
return rt
|
|
}
|
|
if rt, ok := unicode.Scripts[class]; ok {
|
|
return rt
|
|
}
|
|
|
|
// cannot happen
|
|
panic(fmt.Sprintf("invalid Unicode class: %s", class))
|
|
}
|