Class: Stupidedi::Builder::BuilderDsl

20
21
22
23
24
25

# File 'lib/stupidedi/builder/builder_dsl.rb', line 20

def initialize(machine, strict = true)
  @machine = machine
  @strict  = strict
  @reader  = DslReader.new(Reader::Separators.empty,
                           Reader::SegmentDict.empty)
end

91
92
93
94
95
96
97

# File 'lib/stupidedi/builder/builder_dsl.rb', line 91

def method_missing(name, *args)
  if SEGMENT_ID =~ name.to_s
    segment!(name, Reader::Position.caller(2), *args)
  else
    super
  end
end

247
248
249

# File 'lib/stupidedi/builder/builder_dsl.rb', line 247

def build(config, strict = true)
  new(StateMachine.build(config), strict)
end

32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87

# File 'lib/stupidedi/builder/builder_dsl.rb', line 32

def segment!(name, position, *elements)
  segment_tok     = mksegment_tok(@reader.segment_dict, name, elements, position)
  machine, reader = @machine.insert(segment_tok, @reader)

  if @strict
    unless machine.deterministic?
      matches = machine.active.map do |m|
        segment_def = m.node.zipper.node.definition
        "#{segment_def.id} #{segment_def.name}"
      end.join(", ")

      raise Exceptions::ParseError,
        "non-deterministic machine state: #{matches}"
    end

    # Validate the new segment (recursively, including its children)
    machine.active.each{|m| critique(m.node.zipper) }

    # We want to detect when we've ended a syntax node (or more), like
    # starting a new interchange will end all previously "open" syntax
    # nodes. So we compare the state before adding `segment_tok` to the
    # corresponding state after we've added `segment_tok`.

    machine.prev.tap do |prev|
      prev.active.zip(machine.active) do |p, q|
        # If the new state `q` is a descendent of `p`, we know that `p`
        # and all of its ancestors are unterminated. However, if `q` is
        # not a descendent of `p`, but is a descendent of one of `p`s
        # descendents, then `p` and perhaps some of its ancestors were
        # terminated when the state transitioned to `q`.
        qancestors = Set.new

        # Operate on the syntax tree (instead of the state tree)
        q = q.node.zipper
        p = p.node.zipper

        while q.respond_to?(:parent)
          qancestors << q.parent
          q = q.parent
        end

        while p.respond_to?(:parent)
          break if qancestors.include?(p)

          critique(p)
          p = p.parent
        end
      end
    end
  end

  @machine = machine
  @reader  = reader

  self
end