ebnf

type Annotations struct {
	// Word is the production a generator extracts keywords from.
	Word string

	// Extras may appear between any two tokens. Each is a name with no
	// production, bound by a file-level token directive.
	Extras []string

	// Tokens maps a name to the pattern the named lex symbol holds.
	Tokens map[string]string

	// Conflicts are pairs of productions a generator has to consider
	// together.
	Conflicts [][]string

	// Prods holds what is said about each production, by name.
	Prods map[string]ProdAnnotations
	// contains filtered or unexported fields
}

type File struct {
	Grammar     ebnf.Grammar
	Annotations Annotations
}

type Options struct {
	// Start is the production everything must be reachable from.
	Start string

	// LexSpellings requires every quoted terminal to be text lex turns
	// into exactly one token.
	LexSpellings bool

	// Annotated reads the `/*@ ... */` comments and holds the file to
	// them: every production with no expression needs a token binding,
	// and every name an annotation mentions has to exist.
	Annotated bool
}

type ProdAnnotations struct {
	Hidden   bool   // structure the tree without appearing in it
	Inline   bool   // substitute into callers instead
	External bool   // a terminal a hand-written scanner produces
	Assoc    string // "", "left", or "right"
	Prec     int    // meaningful when Assoc is set or Prec is non-zero
	HasPrec  bool
	Token    string // the pattern the named lex symbol holds
}