brevity 0.4.0

data/lib/brevity/parsing/expression/expression.rb

@@ -0,0 +1,429 @@
+# Autogenerated from a Treetop grammar. Edits may be lost.
+
+
+module Brevity
+
+module Expression
+  include Treetop::Runtime
+
+  def root
+    @root ||= :expression
+  end
+
+  include Gradual
+
+  include Dynamic
+
+  include Note
+
+  include Label
+
+  include Modifier
+
+  module Expression0
+    def expr
+      elements[1]
+    end
+  end
+
+  module Expression1
+    def expr
+      elements[1]
+    end
+
+    def more
+      elements[2]
+    end
+
+  end
+
+  def _nt_expression
+    start_index = index
+    if node_cache[:expression].has_key?(index)
+      cached = node_cache[:expression][index]
+      if cached
+        node_cache[:expression][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    s1, i1 = [], index
+    loop do
+      if has_terminal?(@regexps[gr = '\A[\\s]'] ||= Regexp.new(gr), :regexp, index)
+        r2 = true
+        @index += 1
+      else
+        terminal_parse_failure('[\\s]')
+        r2 = nil
+      end
+      if r2
+        s1 << r2
+      else
+        break
+      end
+    end
+    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
+    s0 << r1
+    if r1
+      r3 = _nt_expr
+      s0 << r3
+      if r3
+        s4, i4 = [], index
+        loop do
+          i5, s5 = index, []
+          s6, i6 = [], index
+          loop do
+            if has_terminal?(@regexps[gr = '\A[\\s]'] ||= Regexp.new(gr), :regexp, index)
+              r7 = true
+              @index += 1
+            else
+              terminal_parse_failure('[\\s]')
+              r7 = nil
+            end
+            if r7
+              s6 << r7
+            else
+              break
+            end
+          end
+          if s6.empty?
+            @index = i6
+            r6 = nil
+          else
+            r6 = instantiate_node(SyntaxNode,input, i6...index, s6)
+          end
+          s5 << r6
+          if r6
+            r8 = _nt_expr
+            s5 << r8
+          end
+          if s5.last
+            r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
+            r5.extend(Expression0)
+          else
+            @index = i5
+            r5 = nil
+          end
+          if r5
+            s4 << r5
+          else
+            break
+          end
+        end
+        r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
+        s0 << r4
+        if r4
+          s9, i9 = [], index
+          loop do
+            if has_terminal?(@regexps[gr = '\A[\\s]'] ||= Regexp.new(gr), :regexp, index)
+              r10 = true
+              @index += 1
+            else
+              terminal_parse_failure('[\\s]')
+              r10 = nil
+            end
+            if r10
+              s9 << r10
+            else
+              break
+            end
+          end
+          r9 = instantiate_node(SyntaxNode,input, i9...index, s9)
+          s0 << r9
+        end
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(ExpressionNode,input, i0...index, s0)
+      r0.extend(Expression1)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:expression][start_index] = r0
+
+    r0
+  end
+
+  def _nt_expr_element
+    start_index = index
+    if node_cache[:expr_element].has_key?(index)
+      cached = node_cache[:expr_element][index]
+      if cached
+        node_cache[:expr_element][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    r1 = _nt_gradual
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+    else
+      r2 = _nt_dynamic
+      if r2
+        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+        r0 = r2
+      else
+        r3 = _nt_note
+        if r3
+          r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
+          r0 = r3
+        else
+          r4 = _nt_label
+          r4.extend(ExprElementNode)
+          if r4
+            r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
+            r0 = r4
+          else
+            @index = i0
+            r0 = nil
+          end
+        end
+      end
+    end
+
+    node_cache[:expr_element][start_index] = r0
+
+    r0
+  end
+
+  def _nt_expr
+    start_index = index
+    if node_cache[:expr].has_key?(index)
+      cached = node_cache[:expr][index]
+      if cached
+        node_cache[:expr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    r1 = _nt_nonmodifiable
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+    else
+      r2 = _nt_modifiable
+      if r2
+        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+        r0 = r2
+      else
+        @index = i0
+        r0 = nil
+      end
+    end
+
+    node_cache[:expr][start_index] = r0
+
+    r0
+  end
+
+  module Modifiable0
+    def base
+      elements[0]
+    end
+
+    def mods
+      elements[1]
+    end
+  end
+
+  def _nt_modifiable
+    start_index = index
+    if node_cache[:modifiable].has_key?(index)
+      cached = node_cache[:modifiable][index]
+      if cached
+        node_cache[:modifiable][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    i1 = index
+    r2 = _nt_group
+    if r2
+      r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+      r1 = r2
+    else
+      r3 = _nt_label
+      if r3
+        r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
+        r1 = r3
+      else
+        r4 = _nt_note
+        if r4
+          r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
+          r1 = r4
+        else
+          @index = i1
+          r1 = nil
+        end
+      end
+    end
+    s0 << r1
+    if r1
+      s5, i5 = [], index
+      loop do
+        r6 = _nt_modifier
+        if r6
+          s5 << r6
+        else
+          break
+        end
+      end
+      r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
+      s0 << r5
+    end
+    if s0.last
+      r0 = instantiate_node(ModifiableNode,input, i0...index, s0)
+      r0.extend(Modifiable0)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:modifiable][start_index] = r0
+
+    r0
+  end
+
+  module Group0
+    def expression
+      elements[2]
+    end
+
+  end
+
+  def _nt_group
+    start_index = index
+    if node_cache[:group].has_key?(index)
+      cached = node_cache[:group][index]
+      if cached
+        node_cache[:group][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    if (match_len = has_terminal?("(", false, index))
+      r1 = true
+      @index += match_len
+    else
+      terminal_parse_failure("(")
+      r1 = nil
+    end
+    s0 << r1
+    if r1
+      s2, i2 = [], index
+      loop do
+        if has_terminal?(@regexps[gr = '\A[\\s]'] ||= Regexp.new(gr), :regexp, index)
+          r3 = true
+          @index += 1
+        else
+          terminal_parse_failure('[\\s]')
+          r3 = nil
+        end
+        if r3
+          s2 << r3
+        else
+          break
+        end
+      end
+      r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
+      s0 << r2
+      if r2
+        r4 = _nt_expression
+        s0 << r4
+        if r4
+          s5, i5 = [], index
+          loop do
+            if has_terminal?(@regexps[gr = '\A[\\s]'] ||= Regexp.new(gr), :regexp, index)
+              r6 = true
+              @index += 1
+            else
+              terminal_parse_failure('[\\s]')
+              r6 = nil
+            end
+            if r6
+              s5 << r6
+            else
+              break
+            end
+          end
+          r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
+          s0 << r5
+          if r5
+            if (match_len = has_terminal?(")", false, index))
+              r7 = true
+              @index += match_len
+            else
+              terminal_parse_failure(")")
+              r7 = nil
+            end
+            s0 << r7
+          end
+        end
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(GroupNode,input, i0...index, s0)
+      r0.extend(Group0)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:group][start_index] = r0
+
+    r0
+  end
+
+  def _nt_nonmodifiable
+    start_index = index
+    if node_cache[:nonmodifiable].has_key?(index)
+      cached = node_cache[:nonmodifiable][index]
+      if cached
+        node_cache[:nonmodifiable][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    r1 = _nt_gradual
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+    else
+      r2 = _nt_dynamic
+      if r2
+        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+        r0 = r2
+      else
+        @index = i0
+        r0 = nil
+      end
+    end
+
+    node_cache[:nonmodifiable][start_index] = r0
+
+    r0
+  end
+
+end
+
+class ExpressionParser < Treetop::Runtime::CompiledParser
+  include Expression
+end
+
+
+end

data/lib/brevity/parsing/expression/expression.treetop

@@ -0,0 +1,39 @@
+module Brevity
+
+grammar Expression
+  include Gradual
+  include Dynamic
+  include Note
+  include Label
+  include Modifier
+  
+  rule expression
+    [\s]*
+    expr
+    more:([\s]+ expr)*
+    [\s]*
+    <ExpressionNode>
+  end
+  
+  rule expr_element
+    gradual / dynamic / note / label <ExprElementNode>
+  end
+  
+  rule expr
+    nonmodifiable / modifiable
+  end
+  
+  rule modifiable
+    base:(group / label / note) mods:modifier* <ModifiableNode>
+  end
+  
+  rule group
+    "(" [\s]* expression [\s]* ")" <GroupNode>
+  end
+
+  rule nonmodifiable
+    gradual / dynamic
+  end  
+end
+
+end

data/lib/brevity/parsing/expression/expression_nodes.rb

@@ -0,0 +1,26 @@
+module Brevity
+  class ExpressionNode < Treetop::Runtime::SyntaxNode
+    def primitives env
+      exprs = [expr] + more.elements.map {|el| el.expr}
+      return exprs.map {|e| e.primitives(env) }.flatten
+    end    
+  end
+  
+  class GroupNode < Treetop::Runtime::SyntaxNode
+    def primitives env
+      expression.primitives(env)
+    end
+  end
+
+  class ModifiableNode < Treetop::Runtime::SyntaxNode
+    def primitives env
+      primitives = base.primitives(env)
+      
+      mods.elements.each do |modnode|
+        primitives = modnode.process primitives
+      end
+      
+      return primitives
+    end
+  end
+end

data/lib/brevity/parsing/expression/gradual.rb

@@ -0,0 +1,44 @@
+# Autogenerated from a Treetop grammar. Edits may be lost.
+
+
+module Brevity
+
+module Gradual
+  include Treetop::Runtime
+
+  def root
+    @root ||= :gradual
+  end
+
+  def _nt_gradual
+    start_index = index
+    if node_cache[:gradual].has_key?(index)
+      cached = node_cache[:gradual][index]
+      if cached
+        node_cache[:gradual][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    if has_terminal?(@regexps[gr = '\A[<>]'] ||= Regexp.new(gr), :regexp, index)
+      r0 = instantiate_node(GradualNode,input, index...(index + 1))
+      @index += 1
+    else
+      terminal_parse_failure('[<>]')
+      r0 = nil
+    end
+
+    node_cache[:gradual][start_index] = r0
+
+    r0
+  end
+
+end
+
+class GradualParser < Treetop::Runtime::CompiledParser
+  include Gradual
+end
+
+
+end

data/lib/brevity/parsing/expression/gradual.treetop

@@ -0,0 +1,9 @@
+module Brevity
+
+grammar Gradual
+  rule gradual
+    [<>] <GradualNode>
+  end
+end
+
+end

data/lib/brevity/parsing/expression/gradual_node.rb

@@ -0,0 +1,11 @@
+module Brevity
+  class GradualNode < Treetop::Runtime::SyntaxNode
+    def primitives env
+      [ self ]
+    end
+    
+    def ==(other)
+      other.is_a?(GradualNode)
+    end
+  end
+end

data/lib/brevity/parsing/expression/label.rb

@@ -0,0 +1,75 @@
+# Autogenerated from a Treetop grammar. Edits may be lost.
+
+
+module Brevity
+
+module Label
+  include Treetop::Runtime
+
+  def root
+    @root ||= :label
+  end
+
+  module Label0
+  end
+
+  def _nt_label
+    start_index = index
+    if node_cache[:label].has_key?(index)
+      cached = node_cache[:label][index]
+      if cached
+        node_cache[:label][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    if has_terminal?(@regexps[gr = '\A[_A-Za-z]'] ||= Regexp.new(gr), :regexp, index)
+      r1 = true
+      @index += 1
+    else
+      terminal_parse_failure('[_A-Za-z]')
+      r1 = nil
+    end
+    s0 << r1
+    if r1
+      s2, i2 = [], index
+      loop do
+        if has_terminal?(@regexps[gr = '\A[_A-Za-z0-9]'] ||= Regexp.new(gr), :regexp, index)
+          r3 = true
+          @index += 1
+        else
+          terminal_parse_failure('[_A-Za-z0-9]')
+          r3 = nil
+        end
+        if r3
+          s2 << r3
+        else
+          break
+        end
+      end
+      r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
+      s0 << r2
+    end
+    if s0.last
+      r0 = instantiate_node(LabelNode,input, i0...index, s0)
+      r0.extend(Label0)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:label][start_index] = r0
+
+    r0
+  end
+
+end
+
+class LabelParser < Treetop::Runtime::CompiledParser
+  include Label
+end
+
+
+end

data/lib/brevity/parsing/expression/label.treetop

@@ -0,0 +1,9 @@
+module Brevity
+
+grammar Label
+  rule label
+    [_A-Za-z] [_A-Za-z0-9]* <LabelNode>
+  end
+end
+
+end

data/lib/brevity/parsing/expression/label_node.rb

@@ -0,0 +1,15 @@
+module Brevity
+  class LabelNode < Treetop::Runtime::SyntaxNode
+    def to_key
+      text_value.to_sym
+    end
+    
+    def primitives env
+      env.fetch(self.to_key).clone
+    end
+      
+    def itemize(env)
+      env.fetch(self.to_key).clone
+    end
+  end
+end