musicality 0.1.0

data/lib/musicality/notation/parsing/numbers/positive_float_parsing.rb

@@ -0,0 +1,503 @@
+# Autogenerated from a Treetop grammar. Edits may be lost.
+
+
+module Musicality
+module Parsing
+
+module PositiveFloat
+  include Treetop::Runtime
+
+  def root
+    @root ||= :positive_float
+  end
+
+  module PositiveFloat0
+    def to_f
+      text_value.to_f
+    end
+    
+    alias :to_num :to_f
+  end
+
+  def _nt_positive_float
+    start_index = index
+    if node_cache[:positive_float].has_key?(index)
+      cached = node_cache[:positive_float][index]
+      if cached
+        node_cache[:positive_float][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    r1 = _nt_float1
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+      r0.extend(PositiveFloat0)
+    else
+      r2 = _nt_float2
+      if r2
+        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+        r0 = r2
+        r0.extend(PositiveFloat0)
+      else
+        r3 = _nt_float3
+        if r3
+          r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
+          r0 = r3
+          r0.extend(PositiveFloat0)
+        else
+          @index = i0
+          r0 = nil
+        end
+      end
+    end
+
+    node_cache[:positive_float][start_index] = r0
+
+    r0
+  end
+
+  module Float10
+    def exponent
+      elements[3]
+    end
+  end
+
+  def _nt_float1
+    start_index = index
+    if node_cache[:float1].has_key?(index)
+      cached = node_cache[:float1][index]
+      if cached
+        node_cache[:float1][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[0]'] ||= Regexp.new(gr), :regexp, index)
+        r2 = true
+        @index += 1
+      else
+        terminal_parse_failure('[0]')
+        r2 = nil
+      end
+      if r2
+        s1 << r2
+      else
+        break
+      end
+    end
+    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
+    s0 << r1
+    if r1
+      s3, i3 = [], index
+      loop do
+        if has_terminal?(@regexps[gr = '\A[1-9]'] ||= Regexp.new(gr), :regexp, index)
+          r4 = true
+          @index += 1
+        else
+          terminal_parse_failure('[1-9]')
+          r4 = nil
+        end
+        if r4
+          s3 << r4
+        else
+          break
+        end
+      end
+      if s3.empty?
+        @index = i3
+        r3 = nil
+      else
+        r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
+      end
+      s0 << r3
+      if r3
+        s5, i5 = [], index
+        loop do
+          if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index)
+            r6 = true
+            @index += 1
+          else
+            terminal_parse_failure('[0-9]')
+            r6 = nil
+          end
+          if r6
+            s5 << r6
+          else
+            break
+          end
+        end
+        r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
+        s0 << r5
+        if r5
+          r7 = _nt_exponent
+          s0 << r7
+        end
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(Float10)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:float1][start_index] = r0
+
+    r0
+  end
+
+  module Float20
+  end
+
+  def _nt_float2
+    start_index = index
+    if node_cache[:float2].has_key?(index)
+      cached = node_cache[:float2][index]
+      if cached
+        node_cache[:float2][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[0]'] ||= Regexp.new(gr), :regexp, index)
+        r2 = true
+        @index += 1
+      else
+        terminal_parse_failure('[0]')
+        r2 = nil
+      end
+      if r2
+        s1 << r2
+      else
+        break
+      end
+    end
+    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
+    s0 << r1
+    if r1
+      s3, i3 = [], index
+      loop do
+        if has_terminal?(@regexps[gr = '\A[1-9]'] ||= Regexp.new(gr), :regexp, index)
+          r4 = true
+          @index += 1
+        else
+          terminal_parse_failure('[1-9]')
+          r4 = nil
+        end
+        if r4
+          s3 << r4
+        else
+          break
+        end
+      end
+      if s3.empty?
+        @index = i3
+        r3 = nil
+      else
+        r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
+      end
+      s0 << r3
+      if r3
+        s5, i5 = [], index
+        loop do
+          if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index)
+            r6 = true
+            @index += 1
+          else
+            terminal_parse_failure('[0-9]')
+            r6 = nil
+          end
+          if r6
+            s5 << r6
+          else
+            break
+          end
+        end
+        r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
+        s0 << r5
+        if r5
+          if has_terminal?(@regexps[gr = '\A[.]'] ||= Regexp.new(gr), :regexp, index)
+            r7 = true
+            @index += 1
+          else
+            terminal_parse_failure('[.]')
+            r7 = nil
+          end
+          s0 << r7
+          if r7
+            s8, i8 = [], index
+            loop do
+              if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index)
+                r9 = true
+                @index += 1
+              else
+                terminal_parse_failure('[0-9]')
+                r9 = nil
+              end
+              if r9
+                s8 << r9
+              else
+                break
+              end
+            end
+            if s8.empty?
+              @index = i8
+              r8 = nil
+            else
+              r8 = instantiate_node(SyntaxNode,input, i8...index, s8)
+            end
+            s0 << r8
+            if r8
+              r11 = _nt_exponent
+              if r11
+                r10 = r11
+              else
+                r10 = instantiate_node(SyntaxNode,input, index...index)
+              end
+              s0 << r10
+            end
+          end
+        end
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(Float20)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:float2][start_index] = r0
+
+    r0
+  end
+
+  module Float30
+  end
+
+  def _nt_float3
+    start_index = index
+    if node_cache[:float3].has_key?(index)
+      cached = node_cache[:float3][index]
+      if cached
+        node_cache[:float3][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[0]'] ||= Regexp.new(gr), :regexp, index)
+        r2 = true
+        @index += 1
+      else
+        terminal_parse_failure('[0]')
+        r2 = nil
+      end
+      if r2
+        s1 << r2
+      else
+        break
+      end
+    end
+    if s1.empty?
+      @index = i1
+      r1 = nil
+    else
+      r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
+    end
+    s0 << r1
+    if r1
+      if has_terminal?(@regexps[gr = '\A[.]'] ||= Regexp.new(gr), :regexp, index)
+        r3 = true
+        @index += 1
+      else
+        terminal_parse_failure('[.]')
+        r3 = nil
+      end
+      s0 << r3
+      if r3
+        s4, i4 = [], index
+        loop do
+          if has_terminal?(@regexps[gr = '\A[0]'] ||= Regexp.new(gr), :regexp, index)
+            r5 = true
+            @index += 1
+          else
+            terminal_parse_failure('[0]')
+            r5 = nil
+          end
+          if r5
+            s4 << r5
+          else
+            break
+          end
+        end
+        r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
+        s0 << r4
+        if r4
+          s6, i6 = [], index
+          loop do
+            if has_terminal?(@regexps[gr = '\A[1-9]'] ||= Regexp.new(gr), :regexp, index)
+              r7 = true
+              @index += 1
+            else
+              terminal_parse_failure('[1-9]')
+              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
+          s0 << r6
+          if r6
+            s8, i8 = [], index
+            loop do
+              if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index)
+                r9 = true
+                @index += 1
+              else
+                terminal_parse_failure('[0-9]')
+                r9 = nil
+              end
+              if r9
+                s8 << r9
+              else
+                break
+              end
+            end
+            r8 = instantiate_node(SyntaxNode,input, i8...index, s8)
+            s0 << r8
+            if r8
+              r11 = _nt_exponent
+              if r11
+                r10 = r11
+              else
+                r10 = instantiate_node(SyntaxNode,input, index...index)
+              end
+              s0 << r10
+            end
+          end
+        end
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(Float30)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:float3][start_index] = r0
+
+    r0
+  end
+
+  module Exponent0
+  end
+
+  def _nt_exponent
+    start_index = index
+    if node_cache[:exponent].has_key?(index)
+      cached = node_cache[:exponent][index]
+      if cached
+        node_cache[:exponent][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?("e", false, index))
+      r1 = true
+      @index += match_len
+    else
+      terminal_parse_failure("e")
+      r1 = nil
+    end
+    s0 << r1
+    if r1
+      if has_terminal?(@regexps[gr = '\A[+-]'] ||= Regexp.new(gr), :regexp, index)
+        r3 = true
+        @index += 1
+      else
+        terminal_parse_failure('[+-]')
+        r3 = nil
+      end
+      if r3
+        r2 = r3
+      else
+        r2 = instantiate_node(SyntaxNode,input, index...index)
+      end
+      s0 << r2
+      if r2
+        s4, i4 = [], index
+        loop do
+          if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index)
+            r5 = true
+            @index += 1
+          else
+            terminal_parse_failure('[0-9]')
+            r5 = nil
+          end
+          if r5
+            s4 << r5
+          else
+            break
+          end
+        end
+        if s4.empty?
+          @index = i4
+          r4 = nil
+        else
+          r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
+        end
+        s0 << r4
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(Exponent0)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:exponent][start_index] = r0
+
+    r0
+  end
+
+end
+
+class PositiveFloatParser < Treetop::Runtime::CompiledParser
+  include PositiveFloat
+end
+
+
+end
+end

data/lib/musicality/notation/parsing/numbers/positive_float_parsing.treetop

@@ -0,0 +1,33 @@
+module Musicality
+module Parsing
+
+grammar PositiveFloat
+  rule positive_float
+    (float1 / float2 / float3) {
+      def to_f
+        text_value.to_f
+      end
+      
+      alias :to_num :to_f
+    }
+  end
+
+  rule float1
+    [0]* [1-9]+ [0-9]* exponent
+  end
+  
+  rule float2
+    [0]* [1-9]+ [0-9]* [.] [0-9]+ exponent?
+  end
+  
+  rule float3
+    [0]+ [.] [0]* [1-9]+ [0-9]* exponent?
+  end
+
+  rule exponent
+    "e" [+-]? [0-9]+
+  end
+end
+
+end
+end

data/lib/musicality/notation/parsing/numbers/positive_integer_parsing.rb

@@ -0,0 +1,95 @@
+# Autogenerated from a Treetop grammar. Edits may be lost.
+
+
+module Musicality
+module Parsing
+
+module PositiveInteger
+  include Treetop::Runtime
+
+  def root
+    @root ||= :positive_integer
+  end
+
+  include NonnegativeInteger
+
+  module PositiveInteger0
+    def nonnegative_integer
+      elements[2]
+    end
+  end
+
+  module PositiveInteger1
+    def to_i
+      text_value.to_i
+    end
+    
+    alias :to_num :to_i
+  end
+
+  def _nt_positive_integer
+    start_index = index
+    if node_cache[:positive_integer].has_key?(index)
+      cached = node_cache[:positive_integer][index]
+      if cached
+        node_cache[:positive_integer][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[0]'] ||= Regexp.new(gr), :regexp, index)
+        r2 = true
+        @index += 1
+      else
+        terminal_parse_failure('[0]')
+        r2 = nil
+      end
+      if r2
+        s1 << r2
+      else
+        break
+      end
+    end
+    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
+    s0 << r1
+    if r1
+      if has_terminal?(@regexps[gr = '\A[1-9]'] ||= Regexp.new(gr), :regexp, index)
+        r3 = true
+        @index += 1
+      else
+        terminal_parse_failure('[1-9]')
+        r3 = nil
+      end
+      s0 << r3
+      if r3
+        r4 = _nt_nonnegative_integer
+        s0 << r4
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(PositiveInteger0)
+      r0.extend(PositiveInteger1)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:positive_integer][start_index] = r0
+
+    r0
+  end
+
+end
+
+class PositiveIntegerParser < Treetop::Runtime::CompiledParser
+  include PositiveInteger
+end
+
+
+end
+end

data/lib/musicality/notation/parsing/numbers/positive_integer_parsing.treetop

@@ -0,0 +1,19 @@
+module Musicality
+module Parsing
+
+grammar PositiveInteger
+  include NonnegativeInteger
+  
+  rule positive_integer
+    [0]* [1-9] nonnegative_integer {
+      def to_i
+        text_value.to_i
+      end
+      
+      alias :to_num :to_i
+    }
+  end
+end
+
+end
+end

data/lib/musicality/notation/parsing/numbers/positive_rational_parsing.rb

@@ -0,0 +1,84 @@
+# Autogenerated from a Treetop grammar. Edits may be lost.
+
+
+module Musicality
+module Parsing
+
+module PositiveRational
+  include Treetop::Runtime
+
+  def root
+    @root ||= :positive_rational
+  end
+
+  include PositiveInteger
+
+  module PositiveRational0
+    def positive_integer1
+      elements[0]
+    end
+
+    def positive_integer2
+      elements[2]
+    end
+  end
+
+  module PositiveRational1
+    def to_r
+      text_value.to_r
+    end
+    
+    alias :to_num :to_r
+  end
+
+  def _nt_positive_rational
+    start_index = index
+    if node_cache[:positive_rational].has_key?(index)
+      cached = node_cache[:positive_rational][index]
+      if cached
+        node_cache[:positive_rational][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    r1 = _nt_positive_integer
+    s0 << r1
+    if r1
+      if (match_len = has_terminal?("/", false, index))
+        r2 = true
+        @index += match_len
+      else
+        terminal_parse_failure("/")
+        r2 = nil
+      end
+      s0 << r2
+      if r2
+        r3 = _nt_positive_integer
+        s0 << r3
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(PositiveRational0)
+      r0.extend(PositiveRational1)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:positive_rational][start_index] = r0
+
+    r0
+  end
+
+end
+
+class PositiveRationalParser < Treetop::Runtime::CompiledParser
+  include PositiveRational
+end
+
+
+end
+end