treerack/choice.go
2017-11-04 22:24:55 +01:00

255 lines
4.9 KiB
Go

package treerack
type choiceDefinition struct {
name string
id int
commit CommitType
options []string
optionDefs []definition
generalizations []int
cparser *choiceParser
cbuilder *choiceBuilder
validated bool
initialized bool
}
type choiceParser struct {
name string
id int
commit CommitType
options []parser
generalizations []int
}
type choiceBuilder struct {
name string
id int
commit CommitType
options []builder
}
func newChoice(name string, ct CommitType, options []string) *choiceDefinition {
return &choiceDefinition{
name: name,
commit: ct,
options: options,
}
}
func (d *choiceDefinition) nodeName() string { return d.name }
func (d *choiceDefinition) setNodeName(n string) { d.name = n }
func (d *choiceDefinition) nodeID() int { return d.id }
func (d *choiceDefinition) setID(id int) { d.id = id }
func (d *choiceDefinition) commitType() CommitType { return d.commit }
func (d *choiceDefinition) setCommitType(ct CommitType) { d.commit = ct }
func (d *choiceDefinition) validate(r *registry) error {
if d.validated {
return nil
}
d.validated = true
for i := range d.options {
o, ok := r.definitions[d.options[i]]
if !ok {
return parserNotFound(d.options[i])
}
if err := o.validate(r); err != nil {
return err
}
}
return nil
}
func (d *choiceDefinition) createBuilder() {
if d.cbuilder != nil {
return
}
d.cbuilder = &choiceBuilder{
name: d.name,
id: d.id,
commit: d.commit,
}
}
func (d *choiceDefinition) initOptions(r *registry) {
for _, o := range d.options {
def := r.definitions[o]
d.optionDefs = append(d.optionDefs, def)
def.init(r)
d.cbuilder.options = append(d.cbuilder.options, def.builder())
def.addGeneralization(d.id)
}
}
func (d *choiceDefinition) init(r *registry) {
if d.initialized {
return
}
d.initialized = true
d.createBuilder()
d.initOptions(r)
}
func (d *choiceDefinition) addGeneralization(g int) {
if intsContain(d.generalizations, g) {
return
}
d.generalizations = append(d.generalizations, g)
for _, o := range d.optionDefs {
o.addGeneralization(g)
}
}
func (d *choiceDefinition) createParser() {
d.cparser = &choiceParser{
name: d.name,
id: d.id,
commit: d.commit,
generalizations: d.generalizations,
}
}
func (d *choiceDefinition) createOptionParsers() {
for _, def := range d.optionDefs {
option := def.parser()
d.cparser.options = append(d.cparser.options, option)
}
}
func (d *choiceDefinition) parser() parser {
if d.cparser != nil {
return d.cparser
}
d.createParser()
d.createOptionParsers()
return d.cparser
}
func (d *choiceDefinition) builder() builder { return d.cbuilder }
func (p *choiceParser) nodeName() string { return p.name }
func (p *choiceParser) nodeID() int { return p.id }
func (p *choiceParser) parse(c *context) {
if c.fromResults(p.id) {
return
}
if c.pending(c.offset, p.id) {
c.fail(c.offset)
return
}
c.markPending(c.offset, p.id)
from := c.offset
to := c.offset
var match bool
var optionIndex int
var foundMatch bool
for {
foundMatch = false
optionIndex = 0
// TODO:
// - avoid double parsing by setting first-from-store in the context, prepare in advance to
// know whether it can be it's own item
// - it is also important to figure why disabling the failed options breaks the parsing
for optionIndex < len(p.options) {
p.options[optionIndex].parse(c)
optionIndex++
if !c.matchLast || match && c.offset <= to {
c.offset = from
continue
}
match = true
foundMatch = true
to = c.offset
c.offset = from
c.results.setMatch(from, p.id, to)
}
if !foundMatch {
break
}
}
if match {
c.success(to)
c.unmarkPending(from, p.id)
return
}
c.results.setNoMatch(from, p.id)
c.fail(from)
c.unmarkPending(from, p.id)
}
func (b *choiceBuilder) nodeName() string { return b.name }
func (b *choiceBuilder) nodeID() int { return b.id }
func (b *choiceBuilder) build(c *context) ([]*Node, bool) {
to, ok := c.results.longestMatch(c.offset, b.id)
if !ok {
return nil, false
}
from := c.offset
parsed := to > from
if parsed {
c.results.dropMatchTo(c.offset, b.id, to)
} else {
if c.buildPending(c.offset, b.id, to) {
return nil, false
}
c.markBuildPending(c.offset, b.id, to)
}
var option builder
for _, o := range b.options {
if c.results.hasMatchTo(c.offset, o.nodeID(), to) {
option = o
break
}
}
if option == nil {
panic("damaged parse result")
}
n, ok := option.build(c)
if !ok {
panic("damaged parse result")
}
if !parsed {
c.unmarkBuildPending(from, b.id, to)
}
if b.commit&Alias != 0 {
return n, true
}
return []*Node{{
Name: b.name,
From: from,
To: to,
Nodes: n,
tokens: c.tokens,
}}, true
}