treerack/sequencedefine.go

376 lines
7.7 KiB
Go
Raw Normal View History

2018-01-05 19:06:10 +01:00
package treerack
import (
"fmt"
"io"
"strconv"
)
type sequenceDefinition struct {
name string
id int
commit CommitType
originalItems []SequenceItem
items []SequenceItem
itemDefs []definition
ranges [][]int
generalizations []int
sbuilder *sequenceBuilder
sparser *sequenceParser
allChars bool
validated bool
initialized bool
}
func newSequence(name string, ct CommitType, items []SequenceItem) *sequenceDefinition {
original := make([]SequenceItem, len(items))
for i := range items {
original[i] = items[i]
}
return &sequenceDefinition{
name: name,
commit: ct,
items: items,
originalItems: original,
}
}
func (d *sequenceDefinition) nodeName() string { return d.name }
func (d *sequenceDefinition) setName(n string) { d.name = n }
func (d *sequenceDefinition) nodeID() int { return d.id }
func (d *sequenceDefinition) setID(id int) { d.id = id }
func (d *sequenceDefinition) commitType() CommitType { return d.commit }
func (d *sequenceDefinition) setCommitType(ct CommitType) { d.commit = ct }
func normalizeItemRange(item SequenceItem) SequenceItem {
if item.Min == 0 && item.Max == 0 {
item.Min, item.Max = 1, 1
return item
}
if item.Min <= 0 {
item.Min = 0
}
if item.Max <= 0 {
item.Max = -1
}
return item
}
func (d *sequenceDefinition) initRanges() {
for i, item := range d.items {
item = normalizeItemRange(item)
d.items[i] = item
d.ranges = append(d.ranges, []int{item.Min, item.Max})
}
}
func (d *sequenceDefinition) preinit() {
d.initRanges()
}
func (d *sequenceDefinition) validate(r *registry) error {
if d.validated {
return nil
}
d.validated = true
for i := range d.items {
ii, ok := r.definition(d.items[i].Name)
if !ok {
return parserNotFound(d.items[i].Name)
}
if err := ii.validate(r); err != nil {
return err
}
}
return nil
}
func (d *sequenceDefinition) createBuilder() {
d.sbuilder = &sequenceBuilder{
name: d.name,
id: d.id,
commit: d.commit,
ranges: d.ranges,
}
}
func (d *sequenceDefinition) initItems(r *registry) {
allChars := true
for _, item := range d.items {
def := r.definitions[item.Name]
d.itemDefs = append(d.itemDefs, def)
def.init(r)
d.sbuilder.items = append(d.sbuilder.items, def.builder())
if allChars {
if _, isChar := def.(*charParser); !isChar {
allChars = false
}
}
}
d.sbuilder.allChars = allChars
d.allChars = allChars
}
func (d *sequenceDefinition) init(r *registry) {
if d.initialized {
return
}
d.initialized = true
d.initRanges()
d.createBuilder()
d.initItems(r)
}
func (d *sequenceDefinition) addGeneralization(g int) {
if intsContain(d.generalizations, g) {
return
}
d.generalizations = append(d.generalizations, g)
}
func (d *sequenceDefinition) createParser() {
d.sparser = &sequenceParser{
name: d.name,
id: d.id,
commit: d.commit,
generalizations: d.generalizations,
allChars: d.allChars,
ranges: d.ranges,
}
}
func (d *sequenceDefinition) createItemParsers() {
for _, item := range d.itemDefs {
pi := item.parser()
d.sparser.items = append(d.sparser.items, pi)
}
}
func (d *sequenceDefinition) parser() parser {
if d.sparser != nil {
return d.sparser
}
d.createParser()
d.createItemParsers()
return d.sparser
}
func (d *sequenceDefinition) builder() builder { return d.sbuilder }
func (d *sequenceDefinition) isCharSequence(r *registry) bool {
for i := range d.originalItems {
item := normalizeItemRange(d.originalItems[i])
if item.Min != 1 || item.Max != 1 {
return false
}
itemDef, _ := r.definition(d.originalItems[i].Name)
c, ok := itemDef.(*charParser)
if !ok || !c.isSingleChar() {
return false
}
}
return true
}
func (d *sequenceDefinition) format(r *registry, f formatFlags) string {
if d.isCharSequence(r) {
if len(d.originalItems) == 1 {
itemDef, _ := r.definition(d.originalItems[0].Name)
c, _ := itemDef.(*charParser)
return c.format(r, f)
}
var chars []rune
for i := range d.originalItems {
itemDef, _ := r.definition(d.originalItems[i].Name)
c, _ := itemDef.(*charParser)
chars = append(chars, c.chars[0])
}
chars = escape(charClassEscape, []rune(charClassBanned), chars)
return string(append([]rune{'"'}, append(chars, '"')...))
}
var chars []rune
for i := range d.originalItems {
if len(chars) > 0 {
chars = append(chars, ' ')
}
item := normalizeItemRange(d.originalItems[i])
needsQuantifier := item.Min != 1 || item.Max != 1
itemDef, _ := r.definition(item.Name)
isSymbol := itemDef.commitType()&userDefined != 0
ch, isChoice := itemDef.(*choiceDefinition)
isChoiceOfMultiple := isChoice && len(ch.options) > 1
seq, isSequence := itemDef.(*sequenceDefinition)
isSequenceOfMultiple := isSequence && len(seq.originalItems) > 1 && !seq.isCharSequence(r)
needsGrouping := isChoiceOfMultiple || isSequenceOfMultiple
if isSymbol {
chars = append(chars, []rune(itemDef.nodeName())...)
} else {
if needsGrouping {
chars = append(chars, '(')
}
chars = append(chars, []rune(itemDef.format(r, f))...)
if needsGrouping {
chars = append(chars, ')')
}
}
if !needsQuantifier {
continue
}
if item.Min == 0 && item.Max == 1 {
chars = append(chars, '?')
continue
}
if item.Min == 0 && item.Max < 0 {
chars = append(chars, '*')
continue
}
if item.Min == 1 && item.Max < 0 {
chars = append(chars, '+')
continue
}
chars = append(chars, '{')
if item.Min == item.Max {
chars = append(chars, []rune(strconv.Itoa(item.Min))...)
} else {
if item.Min > 0 {
chars = append(chars, []rune(strconv.Itoa(item.Min))...)
}
chars = append(chars, ',')
if item.Max >= 0 {
chars = append(chars, []rune(strconv.Itoa(item.Max))...)
}
}
chars = append(chars, '}')
}
return string(chars)
}
func (p *sequenceParser) generate(w io.Writer, done map[string]bool) error {
if done[p.name] {
return nil
}
done[p.name] = true
var err error
fprintf := func(f string, args ...interface{}) {
if err != nil {
return
}
_, err = fmt.Fprintf(w, f, args...)
}
fprintf("var p%d = sequenceParser{", p.id)
fprintf("id: %d, commit: %d, allChars: %t,", p.id, p.commit, p.allChars)
if p.commit&userDefined != 0 {
fprintf("name: \"%s\",", p.name)
}
fprintf("ranges: [][]int{")
for i := range p.ranges {
fprintf("{%d, %d},", p.ranges[i][0], p.ranges[i][1])
}
fprintf("},")
fprintf("generalizations: []int{")
for i := range p.generalizations {
fprintf("%d,", p.generalizations[i])
}
fprintf("}};")
for i := range p.items {
if err := p.items[i].(generator).generate(w, done); err != nil {
return err
}
}
fprintf("p%d.items = []parser{", p.id)
for i := range p.items {
fprintf("&p%d,", p.items[i].nodeID())
}
fprintf("};")
return err
}
func (b *sequenceBuilder) generate(w io.Writer, done map[string]bool) error {
if done[b.name] {
return nil
}
done[b.name] = true
var err error
fprintf := func(f string, args ...interface{}) {
if err != nil {
return
}
_, err = fmt.Fprintf(w, f, args...)
}
fprintf("var b%d = sequenceBuilder{", b.id)
fprintf("id: %d, commit: %d, allChars: %t,", b.id, b.commit, b.allChars)
if b.commit&Alias == 0 {
fprintf("name: \"%s\",", b.name)
}
fprintf("ranges: [][]int{")
for i := range b.ranges {
fprintf("{%d, %d},", b.ranges[i][0], b.ranges[i][1])
}
fprintf("}};")
for i := range b.items {
if err := b.items[i].(generator).generate(w, done); err != nil {
return err
}
}
fprintf("b%d.items = []builder{", b.id)
for i := range b.items {
fprintf("&b%d,", b.items[i].nodeID())
}
fprintf("};")
return err
}