middleman 0.10.17 → 0.11.0

data/vendor/gems/gems/treetop-1.4.2/examples/lambda_calculus/lambda_calculus.treetop

@@ -1,132 +0,0 @@
-grammar LambdaCalculus
-  include Arithmetic
-
-  rule program
-    expression more_expressions:(';' space expression)* {
-      def eval(env={})
-        env = env.clone
-        last_eval = nil
-        expressions.each do |exp|
-          last_eval = exp.eval(env)
-        end
-        last_eval
-      end
-      
-      def expressions
-        [expression] + more_expressions.elements.map {|elt| elt.expression}
-      end
-    }
-  end
-
-  rule expression
-    definition / conditional / application / function / super
-  end
-  
-  rule definition
-    'def' space variable space expression {
-      def eval(env)
-        env[variable.name] = expression.eval(env)
-      end
-    }
-  end
-  
-  rule conditional
-    'if' space '(' space condition:expression space ')' space
-    true_case:expression space 'else' space false_case:expression {
-      def eval(env)
-        if condition.eval(env)
-          true_case.eval(env)
-        else
-          false_case.eval(env)
-        end
-      end
-    }
-  end
-  
-  rule primary
-    application / super
-  end
-
-  rule application
-    operator space expression <Application> {
-      def eval(env={})
-        left_associative_apply(operator.eval(env), env)
-      end
-      
-      def left_associative_apply(operator, env)
-        if expression.instance_of?(Application)
-          expression.left_associative_apply(operator.apply(expression.operator.eval(env)), env)
-        else
-          operator.apply(expression.eval(env))
-        end
-      end
-      
-      def to_s(env={})
-        operator.to_s(env) + ' ' + expression.to_s(env)
-      end
-    }
-  end
-  
-  rule operator
-    function / variable
-  end
-  
-  rule non_application
-    function / variable
-  end
-  
-  rule function
-    '\\' param:variable '(' body:expression ')' {
-      class Closure
-        attr_reader :env, :function
-        
-        def initialize(function, env)
-          @function = function
-          @env = env
-        end
-      
-        def apply(arg)
-          function.body.eval(function.param.bind(arg, env))
-        end
-      
-        def to_s(other_env={})
-          "\\#{function.param.to_s}(#{function.body.to_s(other_env.merge(env))})"
-        end
-      end
-      
-      def eval(env={})
-        Closure.new(self, env)
-      end
-      
-      def to_s(env={})
-        eval(env).to_s
-      end
-    }
-  end
-  
-  rule variable
-    !keyword (
-      super {
-        def bind(value, env)
-          env.merge(name => value)
-        end
-
-        def to_s(env={})
-          env.has_key?(name) ? env[name].to_s : name
-      end
-      }
-    )
-  end
-  
-  rule keyword
-    ('if' / 'else') !non_space_char
-  end
-  
-  rule non_space_char
-    ![ \n] .
-  end
-  
-  rule space
-    [ \n]*
-  end
-end

data/vendor/gems/gems/treetop-1.4.2/examples/lambda_calculus/lambda_calculus_node_classes.rb

@@ -1,5 +0,0 @@
-module LambdaCalculus
-  class Application < Treetop::Runtime::SyntaxNode
-    
-  end
-end

data/vendor/gems/gems/treetop-1.4.2/examples/lambda_calculus/lambda_calculus_test.rb

@@ -1,89 +0,0 @@
-dir = File.dirname(__FILE__)
-require File.expand_path("#{dir}/test_helper")
-require File.expand_path("#{dir}/arithmetic_node_classes")
-require File.expand_path("#{dir}/lambda_calculus_node_classes")
-Treetop.load File.expand_path("#{dir}/arithmetic")
-Treetop.load File.expand_path("#{dir}/lambda_calculus")
-
-class Treetop::Runtime::SyntaxNode 
-  def method_missing(method, *args)
-    raise "Node representing #{text_value} does not respond to #{method}"
-  end
-end
-
-class LambdaCalculusParserTest < Test::Unit::TestCase
-  include ParserTestHelper
-  
-  def setup
-    @parser = LambdaCalculusParser.new
-  end
-  
-  def test_free_variable
-    assert_equal 'x', parse('x').eval.to_s
-  end
-  
-  def test_variable_binding
-    variable = parse('x').eval
-    env = variable.bind(1, {})
-    assert_equal 1, env['x']
-  end
-  
-  def test_bound_variable_evaluation
-    assert_equal 1, parse('x').eval({'x' => 1})
-  end
-  
-  def test_identity_function
-    assert_equal '\x(x)', parse('\x(x)').eval.to_s
-  end
-  
-  def test_function_returning_constant_function
-    assert_equal '\x(\y(x))', parse('\x(\y(x))').eval.to_s
-  end
-  
-  def test_identity_function_application
-    assert_equal 1, parse('\x(x) 1').eval
-    assert_equal '\y(y)', parse('\x(x) \y(y)').eval.to_s
-  end
-  
-  def test_constant_function_construction
-    assert_equal '\y(1)', parse('\x(\y(x)) 1').eval.to_s
-  end
-  
-  def test_multiple_argument_application_is_left_associative
-    assert_equal '\b(b)', parse('\x(\y(x y)) \a(a) \b(b)').eval.to_s
-  end
-  
-  def test_parentheses_override_application_order
-    assert_equal '\y(\b(b) y)', parse('\x(\y(x y)) (\a(a) \b(b))').eval.to_s
-  end
-  
-  def test_arithmetic_in_function_body
-    assert_equal 10, parse('\x(x + 5) 5').eval
-  end
-  
-  def test_addition_of_function_results
-    assert_equal 20, parse('\x(x + 5) 5 + \x(15 - x) 5').eval
-  end
-  
-  def test_conditional
-    result = parse('if (x) 1 else 2')
-    assert_equal 1, result.eval({'x' => true})
-    assert_equal 2, result.eval({'x' => false})
-  end
-  
-  def test_keyword
-    assert @parser.parse('if').failure?
-    assert @parser.parse('else').failure?
-    assert parse('elsee').success?
-    assert parse('iff').success?
-  end
-  
-  def test_program
-    result = parse('def fact \x(if (x == 0)
-                                  1
-                                else
-                                  x * fact (x - 1));
-                    fact(5)').eval
-    assert_equal 5 * 4 * 3 * 2, result
-  end
-end

data/vendor/gems/gems/treetop-1.4.2/examples/lambda_calculus/test_helper.rb

@@ -1,18 +0,0 @@
-require 'test/unit'
-require 'rubygems'
-require 'treetop'
-
-module ParserTestHelper
-  def assert_evals_to_self(input)
-    assert_evals_to(input, input)
-  end
-  
-  def parse(input)
-    result = @parser.parse(input)
-    unless result
-      puts @parser.terminal_failures.join("\n")
-    end
-    assert !result.nil?
-    result
-  end
-end

data/vendor/gems/gems/treetop-1.4.2/lib/treetop.rb

@@ -1,16 +0,0 @@
-require 'rubygems'
-
-module Treetop
-  VALID_GRAMMAR_EXT = ['treetop', 'tt']
-  VALID_GRAMMAR_EXT_REGEXP = /\.(#{VALID_GRAMMAR_EXT.join('|')})\Z/o
-end
-
-dir = File.dirname(__FILE__)
-
-TREETOP_ROOT = File.join(dir, 'treetop')
-require File.join(TREETOP_ROOT, "ruby_extensions")
-require File.join(TREETOP_ROOT, "runtime")
-require File.join(TREETOP_ROOT, "compiler")
-
-require 'polyglot'
-Polyglot.register(Treetop::VALID_GRAMMAR_EXT, Treetop)

data/vendor/gems/gems/treetop-1.4.2/lib/treetop/bootstrap_gen_1_metagrammar.rb

@@ -1,45 +0,0 @@
-# This file's job is to load a Treetop::Compiler::Metagrammar and Treetop::Compiler::MetagrammarParser
-# into the environment by compiling the current metagrammar.treetop using a trusted version of Treetop.
-
-require 'rubygems'
-dir = File.dirname(__FILE__)
-
-TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP = '>= 1.1.5'
-
-# Loading trusted version of Treetop to compile the compiler
-gem_spec = Gem.source_index.find_name('treetop', TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP).last
-raise "Install a Treetop Gem version #{TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP} to bootstrap." unless gem_spec
-trusted_treetop_path = gem_spec.full_gem_path
-require File.join(trusted_treetop_path, 'lib', 'treetop')
-
-# Relocating trusted version of Treetop to Trusted::Treetop
-Trusted = Module.new
-Trusted::Treetop = Treetop
-Object.send(:remove_const, :Treetop)
-Object.send(:remove_const, :TREETOP_ROOT)
-
-# Requiring version of Treetop that is under test
-$exclude_metagrammar = true
-require File.expand_path(File.join(dir, '..', 'treetop'))
-
-# Compile and evaluate freshly generated metagrammar source
-METAGRAMMAR_PATH = File.join(TREETOP_ROOT, 'compiler', 'metagrammar.treetop')
-compiled_metagrammar_source = Trusted::Treetop::Compiler::GrammarCompiler.new.ruby_source(METAGRAMMAR_PATH)
-Object.class_eval(compiled_metagrammar_source)
-
-# The compiler under test was compiled with the trusted grammar and therefore depends on its runtime
-# But the runtime in the global namespace is the new runtime. We therefore inject the trusted runtime
-# into the compiler so its parser functions correctly. It will still not work for custom classes that
-# explicitly subclass the wrong runtime. For now I am working around this by keeping 1 generation of
-# backward compatibility in these cases.
-# Treetop::Compiler::Metagrammar.module_eval do
-#   include Trusted::Treetop::Runtime
-# end
-# 
-# Treetop::Compiler.send(:remove_const, :MetagrammarParser)
-# class Treetop::Compiler::MetagrammarParser < Trusted::Treetop::Runtime::CompiledParser
-#   include Treetop::Compiler::Metagrammar
-#   include Trusted::Treetop::Runtime
-# end
-
-$bootstrapped_gen_1_metagrammar = true

data/vendor/gems/gems/treetop-1.4.2/lib/treetop/compiler.rb

@@ -1,6 +0,0 @@
-dir = File.dirname(__FILE__)
-require File.join(dir, *%w[compiler lexical_address_space])
-require File.join(dir, *%w[compiler ruby_builder])
-require File.join(dir, *%w[compiler node_classes])
-require File.join(dir, *%w[compiler metagrammar]) unless defined?($exclude_metagrammar)
-require File.join(dir, *%w[compiler grammar_compiler])

data/vendor/gems/gems/treetop-1.4.2/lib/treetop/compiler/grammar_compiler.rb

@@ -1,44 +0,0 @@
-module Treetop
-  module Compiler
-    AUTOGENERATED = "# Autogenerated from a Treetop grammar. Edits may be lost.\n"
-    class GrammarCompiler
-      def compile(source_path, target_path = source_path.gsub(/\.(treetop|tt)\Z/, '.rb'))
-        File.open(target_path, 'w') do |target_file|
-          target_file.write(AUTOGENERATED+"\n\n")
-          target_file.write(ruby_source(source_path))
-        end
-      end
-
-      # compile a treetop file into ruby
-      def ruby_source(source_path)
-        ruby_source_from_string(File.read(source_path))
-      end
-
-      # compile a string containing treetop source into ruby
-      def ruby_source_from_string(s)
-        parser = MetagrammarParser.new
-        result = parser.parse(s)
-        unless result
-          raise RuntimeError.new(parser.failure_reason)
-        end
-        result.compile
-      end
-    end
-  end
-
-  # compile a treetop source file and load it
-  def self.load(path)
-    adjusted_path = path =~ /\.(treetop|tt)\Z/ ? path : path + '.treetop'
-    File.open(adjusted_path) do |source_file|
-      source = source_file.read
-      source.gsub!(/\b__FILE__\b/, %Q{"#{adjusted_path}"})
-      load_from_string(source)
-    end
-  end
-
-  # compile a treetop source string and load it
-  def self.load_from_string(s)
-    compiler = Treetop::Compiler::GrammarCompiler.new
-    Object.class_eval(compiler.ruby_source_from_string(s))
-  end
-end

data/vendor/gems/gems/treetop-1.4.2/lib/treetop/compiler/lexical_address_space.rb

@@ -1,17 +0,0 @@
-module Treetop
-  module Compiler
-    class LexicalAddressSpace
-      def initialize
-        reset_addresses
-      end
-      
-      def next_address
-        @next_address += 1
-      end
-      
-      def reset_addresses
-        @next_address = -1
-      end
-    end
-  end
-end

data/vendor/gems/gems/treetop-1.4.2/lib/treetop/compiler/metagrammar.rb

@@ -1,3258 +0,0 @@
-# Autogenerated from a Treetop grammar. Edits may be lost.
-
-
-module Treetop
-  module Compiler
-    module Metagrammar
-      include Treetop::Runtime
-
-      def root
-        @root || :treetop_file
-      end
-
-      module TreetopFile0
-        def require_statement
-          elements[1]
-        end
-      end
-
-      module TreetopFile1
-        def requires
-          elements[0]
-        end
-
-        def prefix
-          elements[1]
-        end
-
-        def module_or_grammar
-          elements[2]
-        end
-
-        def suffix
-          elements[3]
-        end
-      end
-
-      module TreetopFile2
-        def compile
-          requires.text_value + prefix.text_value + module_or_grammar.compile + suffix.text_value
-        end
-      end
-
-      def _nt_treetop_file
-        start_index = index
-        if node_cache[:treetop_file].has_key?(index)
-          cached = node_cache[:treetop_file][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        s1, i1 = [], index
-        loop do
-          i2, s2 = index, []
-          r4 = _nt_space
-          if r4
-            r3 = r4
-          else
-            r3 = instantiate_node(SyntaxNode,input, index...index)
-          end
-          s2 << r3
-          if r3
-            r5 = _nt_require_statement
-            s2 << r5
-          end
-          if s2.last
-            r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-            r2.extend(TreetopFile0)
-          else
-            @index = i2
-            r2 = nil
-          end
-          if r2
-            s1 << r2
-          else
-            break
-          end
-        end
-        r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
-        s0 << r1
-        if r1
-          r7 = _nt_space
-          if r7
-            r6 = r7
-          else
-            r6 = instantiate_node(SyntaxNode,input, index...index)
-          end
-          s0 << r6
-          if r6
-            i8 = index
-            r9 = _nt_module_declaration
-            if r9
-              r8 = r9
-            else
-              r10 = _nt_grammar
-              if r10
-                r8 = r10
-              else
-                @index = i8
-                r8 = nil
-              end
-            end
-            s0 << r8
-            if r8
-              r12 = _nt_space
-              if r12
-                r11 = r12
-              else
-                r11 = instantiate_node(SyntaxNode,input, index...index)
-              end
-              s0 << r11
-            end
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-          r0.extend(TreetopFile1)
-          r0.extend(TreetopFile2)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:treetop_file][start_index] = r0
-
-        r0
-      end
-
-      module RequireStatement0
-        def prefix
-          elements[0]
-        end
-
-      end
-
-      def _nt_require_statement
-        start_index = index
-        if node_cache[:require_statement].has_key?(index)
-          cached = node_cache[:require_statement][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        r2 = _nt_space
-        if r2
-          r1 = r2
-        else
-          r1 = instantiate_node(SyntaxNode,input, index...index)
-        end
-        s0 << r1
-        if r1
-          if has_terminal?("require", false, index)
-            r3 = instantiate_node(SyntaxNode,input, index...(index + 7))
-            @index += 7
-          else
-            terminal_parse_failure("require")
-            r3 = nil
-          end
-          s0 << r3
-          if r3
-            s4, i4 = [], index
-            loop do
-              if has_terminal?('\G[ \\t]', true, index)
-                next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                r5 = true
-                @index = next_character
-              else
-                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
-            if r4
-              s6, i6 = [], index
-              loop do
-                if has_terminal?('\G[^\\n\\r]', true, index)
-                  next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                  r7 = true
-                  @index = next_character
-                else
-                  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
-                if has_terminal?('\G[\\n\\r]', true, index)
-                  next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                  r8 = true
-                  @index = next_character
-                else
-                  r8 = nil
-                end
-                s0 << r8
-              end
-            end
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-          r0.extend(RequireStatement0)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:require_statement][start_index] = r0
-
-        r0
-      end
-
-      module ModuleDeclaration0
-        def space1
-          elements[1]
-        end
-
-        def space2
-          elements[4]
-        end
-      end
-
-      module ModuleDeclaration1
-        def space
-          elements[0]
-        end
-
-      end
-
-      module ModuleDeclaration2
-        def prefix
-          elements[0]
-        end
-
-        def module_contents
-          elements[1]
-        end
-
-        def suffix
-          elements[2]
-        end
-      end
-
-      module ModuleDeclaration3
-        def compile
-          prefix.text_value + module_contents.compile + suffix.text_value
-        end
-      end
-
-      def _nt_module_declaration
-        start_index = index
-        if node_cache[:module_declaration].has_key?(index)
-          cached = node_cache[:module_declaration][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        i1, s1 = index, []
-        if has_terminal?('module', false, index)
-          r2 = instantiate_node(SyntaxNode,input, index...(index + 6))
-          @index += 6
-        else
-          terminal_parse_failure('module')
-          r2 = nil
-        end
-        s1 << r2
-        if r2
-          r3 = _nt_space
-          s1 << r3
-          if r3
-            if has_terminal?('\G[A-Z]', true, index)
-              next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-              r4 = true
-              @index = next_character
-            else
-              r4 = nil
-            end
-            s1 << r4
-            if r4
-              s5, i5 = [], index
-              loop do
-                r6 = _nt_alphanumeric_char
-                if r6
-                  s5 << r6
-                else
-                  break
-                end
-              end
-              r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
-              s1 << r5
-              if r5
-                r7 = _nt_space
-                s1 << r7
-              end
-            end
-          end
-        end
-        if s1.last
-          r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
-          r1.extend(ModuleDeclaration0)
-        else
-          @index = i1
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          i8 = index
-          r9 = _nt_module_declaration
-          if r9
-            r8 = r9
-          else
-            r10 = _nt_grammar
-            if r10
-              r8 = r10
-            else
-              @index = i8
-              r8 = nil
-            end
-          end
-          s0 << r8
-          if r8
-            i11, s11 = index, []
-            r12 = _nt_space
-            s11 << r12
-            if r12
-              if has_terminal?('end', false, index)
-                r13 = instantiate_node(SyntaxNode,input, index...(index + 3))
-                @index += 3
-              else
-                terminal_parse_failure('end')
-                r13 = nil
-              end
-              s11 << r13
-            end
-            if s11.last
-              r11 = instantiate_node(SyntaxNode,input, i11...index, s11)
-              r11.extend(ModuleDeclaration1)
-            else
-              @index = i11
-              r11 = nil
-            end
-            s0 << r11
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-          r0.extend(ModuleDeclaration2)
-          r0.extend(ModuleDeclaration3)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:module_declaration][start_index] = r0
-
-        r0
-      end
-
-      module Grammar0
-        def space
-          elements[1]
-        end
-      end
-
-      module Grammar1
-        def space1
-          elements[1]
-        end
-
-        def grammar_name
-          elements[2]
-        end
-
-        def space2
-          elements[3]
-        end
-
-        def declaration_sequence
-          elements[5]
-        end
-
-      end
-
-      def _nt_grammar
-        start_index = index
-        if node_cache[:grammar].has_key?(index)
-          cached = node_cache[:grammar][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('grammar', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 7))
-          @index += 7
-        else
-          terminal_parse_failure('grammar')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          r2 = _nt_space
-          s0 << r2
-          if r2
-            r3 = _nt_grammar_name
-            s0 << r3
-            if r3
-              r4 = _nt_space
-              s0 << r4
-              if r4
-                i6, s6 = index, []
-                if has_terminal?('do', false, index)
-                  r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
-                  @index += 2
-                else
-                  terminal_parse_failure('do')
-                  r7 = nil
-                end
-                s6 << r7
-                if r7
-                  r8 = _nt_space
-                  s6 << r8
-                end
-                if s6.last
-                  r6 = instantiate_node(SyntaxNode,input, i6...index, s6)
-                  r6.extend(Grammar0)
-                else
-                  @index = i6
-                  r6 = nil
-                end
-                if r6
-                  r5 = r6
-                else
-                  r5 = instantiate_node(SyntaxNode,input, index...index)
-                end
-                s0 << r5
-                if r5
-                  r9 = _nt_declaration_sequence
-                  s0 << r9
-                  if r9
-                    r11 = _nt_space
-                    if r11
-                      r10 = r11
-                    else
-                      r10 = instantiate_node(SyntaxNode,input, index...index)
-                    end
-                    s0 << r10
-                    if r10
-                      if has_terminal?('end', false, index)
-                        r12 = instantiate_node(SyntaxNode,input, index...(index + 3))
-                        @index += 3
-                      else
-                        terminal_parse_failure('end')
-                        r12 = nil
-                      end
-                      s0 << r12
-                    end
-                  end
-                end
-              end
-            end
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(Grammar,input, i0...index, s0)
-          r0.extend(Grammar1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:grammar][start_index] = r0
-
-        r0
-      end
-
-      module GrammarName0
-      end
-
-      def _nt_grammar_name
-        start_index = index
-        if node_cache[:grammar_name].has_key?(index)
-          cached = node_cache[:grammar_name][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('\G[A-Z]', true, index)
-          next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-          r1 = true
-          @index = next_character
-        else
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          s2, i2 = [], index
-          loop do
-            r3 = _nt_alphanumeric_char
-            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(SyntaxNode,input, i0...index, s0)
-          r0.extend(GrammarName0)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:grammar_name][start_index] = r0
-
-        r0
-      end
-
-      module DeclarationSequence0
-        def space
-          elements[0]
-        end
-
-        def declaration
-          elements[1]
-        end
-      end
-
-      module DeclarationSequence1
-        def head
-          elements[0]
-        end
-
-        def tail
-          elements[1]
-        end
-      end
-
-      module DeclarationSequence2
-        def declarations
-          [head] + tail
-        end
-    
-        def tail
-          super.elements.map { |elt| elt.declaration }
-        end
-      end
-
-      module DeclarationSequence3
-        def compile(builder)
-        end
-      end
-
-      def _nt_declaration_sequence
-        start_index = index
-        if node_cache[:declaration_sequence].has_key?(index)
-          cached = node_cache[:declaration_sequence][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        i1, s1 = index, []
-        r2 = _nt_declaration
-        s1 << r2
-        if r2
-          s3, i3 = [], index
-          loop do
-            i4, s4 = index, []
-            r5 = _nt_space
-            s4 << r5
-            if r5
-              r6 = _nt_declaration
-              s4 << r6
-            end
-            if s4.last
-              r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
-              r4.extend(DeclarationSequence0)
-            else
-              @index = i4
-              r4 = nil
-            end
-            if r4
-              s3 << r4
-            else
-              break
-            end
-          end
-          r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
-          s1 << r3
-        end
-        if s1.last
-          r1 = instantiate_node(DeclarationSequence,input, i1...index, s1)
-          r1.extend(DeclarationSequence1)
-          r1.extend(DeclarationSequence2)
-        else
-          @index = i1
-          r1 = nil
-        end
-        if r1
-          r0 = r1
-        else
-          if has_terminal?('', false, index)
-            r7 = instantiate_node(SyntaxNode,input, index...(index + 0))
-            r7.extend(DeclarationSequence3)
-            @index += 0
-          else
-            terminal_parse_failure('')
-            r7 = nil
-          end
-          if r7
-            r0 = r7
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:declaration_sequence][start_index] = r0
-
-        r0
-      end
-
-      def _nt_declaration
-        start_index = index
-        if node_cache[:declaration].has_key?(index)
-          cached = node_cache[:declaration][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        r1 = _nt_parsing_rule
-        if r1
-          r0 = r1
-        else
-          r2 = _nt_include_declaration
-          if r2
-            r0 = r2
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:declaration][start_index] = r0
-
-        r0
-      end
-
-      module IncludeDeclaration0
-        def space
-          elements[1]
-        end
-
-      end
-
-      module IncludeDeclaration1
-        def compile(builder)
-          builder << text_value
-        end
-      end
-
-      def _nt_include_declaration
-        start_index = index
-        if node_cache[:include_declaration].has_key?(index)
-          cached = node_cache[:include_declaration][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('include', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 7))
-          @index += 7
-        else
-          terminal_parse_failure('include')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          r2 = _nt_space
-          s0 << r2
-          if r2
-            if has_terminal?('\G[A-Z]', true, index)
-              next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-              r3 = true
-              @index = next_character
-            else
-              r3 = nil
-            end
-            s0 << r3
-            if r3
-              s4, i4 = [], index
-              loop do
-                i5 = index
-                r6 = _nt_alphanumeric_char
-                if r6
-                  r5 = r6
-                else
-                  if has_terminal?('::', false, index)
-                    r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
-                    @index += 2
-                  else
-                    terminal_parse_failure('::')
-                    r7 = nil
-                  end
-                  if r7
-                    r5 = r7
-                  else
-                    @index = i5
-                    r5 = nil
-                  end
-                end
-                if r5
-                  s4 << r5
-                else
-                  break
-                end
-              end
-              r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
-              s0 << r4
-            end
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-          r0.extend(IncludeDeclaration0)
-          r0.extend(IncludeDeclaration1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:include_declaration][start_index] = r0
-
-        r0
-      end
-
-      module ParsingRule0
-        def space
-          elements[1]
-        end
-      end
-
-      module ParsingRule1
-        def space1
-          elements[1]
-        end
-
-        def nonterminal
-          elements[2]
-        end
-
-        def space2
-          elements[3]
-        end
-
-        def parsing_expression
-          elements[5]
-        end
-
-        def space3
-          elements[6]
-        end
-
-      end
-
-      def _nt_parsing_rule
-        start_index = index
-        if node_cache[:parsing_rule].has_key?(index)
-          cached = node_cache[:parsing_rule][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('rule', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 4))
-          @index += 4
-        else
-          terminal_parse_failure('rule')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          r2 = _nt_space
-          s0 << r2
-          if r2
-            r3 = _nt_nonterminal
-            s0 << r3
-            if r3
-              r4 = _nt_space
-              s0 << r4
-              if r4
-                i6, s6 = index, []
-                if has_terminal?('do', false, index)
-                  r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
-                  @index += 2
-                else
-                  terminal_parse_failure('do')
-                  r7 = nil
-                end
-                s6 << r7
-                if r7
-                  r8 = _nt_space
-                  s6 << r8
-                end
-                if s6.last
-                  r6 = instantiate_node(SyntaxNode,input, i6...index, s6)
-                  r6.extend(ParsingRule0)
-                else
-                  @index = i6
-                  r6 = nil
-                end
-                if r6
-                  r5 = r6
-                else
-                  r5 = instantiate_node(SyntaxNode,input, index...index)
-                end
-                s0 << r5
-                if r5
-                  r9 = _nt_parsing_expression
-                  s0 << r9
-                  if r9
-                    r10 = _nt_space
-                    s0 << r10
-                    if r10
-                      if has_terminal?('end', false, index)
-                        r11 = instantiate_node(SyntaxNode,input, index...(index + 3))
-                        @index += 3
-                      else
-                        terminal_parse_failure('end')
-                        r11 = nil
-                      end
-                      s0 << r11
-                    end
-                  end
-                end
-              end
-            end
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(ParsingRule,input, i0...index, s0)
-          r0.extend(ParsingRule1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:parsing_rule][start_index] = r0
-
-        r0
-      end
-
-      def _nt_parsing_expression
-        start_index = index
-        if node_cache[:parsing_expression].has_key?(index)
-          cached = node_cache[:parsing_expression][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        r1 = _nt_choice
-        if r1
-          r0 = r1
-        else
-          r2 = _nt_sequence
-          if r2
-            r0 = r2
-          else
-            r3 = _nt_primary
-            if r3
-              r0 = r3
-            else
-              @index = i0
-              r0 = nil
-            end
-          end
-        end
-
-        node_cache[:parsing_expression][start_index] = r0
-
-        r0
-      end
-
-      module Choice0
-        def alternative
-          elements[3]
-        end
-      end
-
-      module Choice1
-        def head
-          elements[0]
-        end
-
-        def tail
-          elements[1]
-        end
-      end
-
-      module Choice2
-        def alternatives
-          [head] + tail
-        end
-        
-        def tail
-          super.elements.map {|elt| elt.alternative}
-        end
-        
-        def inline_modules
-          (alternatives.map {|alt| alt.inline_modules }).flatten
-        end
-      end
-
-      def _nt_choice
-        start_index = index
-        if node_cache[:choice].has_key?(index)
-          cached = node_cache[:choice][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        r1 = _nt_alternative
-        s0 << r1
-        if r1
-          s2, i2 = [], index
-          loop do
-            i3, s3 = index, []
-            r5 = _nt_space
-            if r5
-              r4 = r5
-            else
-              r4 = instantiate_node(SyntaxNode,input, index...index)
-            end
-            s3 << r4
-            if r4
-              if has_terminal?('/', false, index)
-                r6 = instantiate_node(SyntaxNode,input, index...(index + 1))
-                @index += 1
-              else
-                terminal_parse_failure('/')
-                r6 = nil
-              end
-              s3 << r6
-              if r6
-                r8 = _nt_space
-                if r8
-                  r7 = r8
-                else
-                  r7 = instantiate_node(SyntaxNode,input, index...index)
-                end
-                s3 << r7
-                if r7
-                  r9 = _nt_alternative
-                  s3 << r9
-                end
-              end
-            end
-            if s3.last
-              r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
-              r3.extend(Choice0)
-            else
-              @index = i3
-              r3 = nil
-            end
-            if r3
-              s2 << r3
-            else
-              break
-            end
-          end
-          if s2.empty?
-            @index = i2
-            r2 = nil
-          else
-            r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-          end
-          s0 << r2
-        end
-        if s0.last
-          r0 = instantiate_node(Choice,input, i0...index, s0)
-          r0.extend(Choice1)
-          r0.extend(Choice2)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:choice][start_index] = r0
-
-        r0
-      end
-
-      module Sequence0
-        def space
-          elements[0]
-        end
-
-        def labeled_sequence_primary
-          elements[1]
-        end
-      end
-
-      module Sequence1
-        def head
-          elements[0]
-        end
-
-        def tail
-          elements[1]
-        end
-
-        def node_class_declarations
-          elements[2]
-        end
-      end
-
-      module Sequence2
-        def sequence_elements
-          [head] + tail
-        end
-  
-        def tail
-          super.elements.map {|elt| elt.labeled_sequence_primary }
-        end
-    
-        def inline_modules
-          (sequence_elements.map {|elt| elt.inline_modules}).flatten +
-          [sequence_element_accessor_module] +
-          node_class_declarations.inline_modules
-        end
-    
-        def inline_module_name
-          node_class_declarations.inline_module_name
-        end
-      end
-
-      def _nt_sequence
-        start_index = index
-        if node_cache[:sequence].has_key?(index)
-          cached = node_cache[:sequence][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        r1 = _nt_labeled_sequence_primary
-        s0 << r1
-        if r1
-          s2, i2 = [], index
-          loop do
-            i3, s3 = index, []
-            r4 = _nt_space
-            s3 << r4
-            if r4
-              r5 = _nt_labeled_sequence_primary
-              s3 << r5
-            end
-            if s3.last
-              r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
-              r3.extend(Sequence0)
-            else
-              @index = i3
-              r3 = nil
-            end
-            if r3
-              s2 << r3
-            else
-              break
-            end
-          end
-          if s2.empty?
-            @index = i2
-            r2 = nil
-          else
-            r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-          end
-          s0 << r2
-          if r2
-            r6 = _nt_node_class_declarations
-            s0 << r6
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(Sequence,input, i0...index, s0)
-          r0.extend(Sequence1)
-          r0.extend(Sequence2)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:sequence][start_index] = r0
-
-        r0
-      end
-
-      def _nt_alternative
-        start_index = index
-        if node_cache[:alternative].has_key?(index)
-          cached = node_cache[:alternative][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        r1 = _nt_sequence
-        if r1
-          r0 = r1
-        else
-          r2 = _nt_primary
-          if r2
-            r0 = r2
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:alternative][start_index] = r0
-
-        r0
-      end
-
-      module Primary0
-        def prefix
-          elements[0]
-        end
-
-        def atomic
-          elements[1]
-        end
-      end
-
-      module Primary1
-        def compile(address, builder, parent_expression=nil)
-          prefix.compile(address, builder, self)
-        end
-    
-        def prefixed_expression
-          atomic
-        end
-    
-        def inline_modules
-          atomic.inline_modules
-        end
-    
-        def inline_module_name
-          nil
-        end
-      end
-
-      module Primary2
-        def prefix
-          elements[0]
-        end
-
-        def predicate_block
-          elements[2]
-        end
-      end
-
-      module Primary3
-        def compile(address, builder, parent_expression=nil)
-          prefix.compile(address, builder, self)
-        end
-        def prefixed_expression
-          predicate_block
-        end
-        def inline_modules
-          []
-        end
-      end
-
-      module Primary4
-        def atomic
-          elements[0]
-        end
-
-        def suffix
-          elements[1]
-        end
-
-        def node_class_declarations
-          elements[2]
-        end
-      end
-
-      module Primary5
-        def compile(address, builder, parent_expression=nil)
-          suffix.compile(address, builder, self)
-        end
-    
-        def optional_expression
-          atomic
-        end
-    
-        def node_class_name
-          node_class_declarations.node_class_name
-        end
-    
-        def inline_modules
-          atomic.inline_modules + node_class_declarations.inline_modules
-        end
-    
-        def inline_module_name
-          node_class_declarations.inline_module_name
-        end
-      end
-
-      module Primary6
-        def atomic
-          elements[0]
-        end
-
-        def node_class_declarations
-          elements[1]
-        end
-      end
-
-      module Primary7
-        def compile(address, builder, parent_expression=nil)
-          atomic.compile(address, builder, self)
-        end
-    
-        def node_class_name
-          node_class_declarations.node_class_name
-        end
-    
-        def inline_modules
-          atomic.inline_modules + node_class_declarations.inline_modules
-        end
-    
-        def inline_module_name
-          node_class_declarations.inline_module_name
-        end
-      end
-
-      def _nt_primary
-        start_index = index
-        if node_cache[:primary].has_key?(index)
-          cached = node_cache[:primary][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        i1, s1 = index, []
-        r2 = _nt_prefix
-        s1 << r2
-        if r2
-          r3 = _nt_atomic
-          s1 << r3
-        end
-        if s1.last
-          r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
-          r1.extend(Primary0)
-          r1.extend(Primary1)
-        else
-          @index = i1
-          r1 = nil
-        end
-        if r1
-          r0 = r1
-        else
-          i4, s4 = index, []
-          r5 = _nt_prefix
-          s4 << r5
-          if r5
-            r7 = _nt_space
-            if r7
-              r6 = r7
-            else
-              r6 = instantiate_node(SyntaxNode,input, index...index)
-            end
-            s4 << r6
-            if r6
-              r8 = _nt_predicate_block
-              s4 << r8
-            end
-          end
-          if s4.last
-            r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
-            r4.extend(Primary2)
-            r4.extend(Primary3)
-          else
-            @index = i4
-            r4 = nil
-          end
-          if r4
-            r0 = r4
-          else
-            i9, s9 = index, []
-            r10 = _nt_atomic
-            s9 << r10
-            if r10
-              r11 = _nt_suffix
-              s9 << r11
-              if r11
-                r12 = _nt_node_class_declarations
-                s9 << r12
-              end
-            end
-            if s9.last
-              r9 = instantiate_node(SyntaxNode,input, i9...index, s9)
-              r9.extend(Primary4)
-              r9.extend(Primary5)
-            else
-              @index = i9
-              r9 = nil
-            end
-            if r9
-              r0 = r9
-            else
-              i13, s13 = index, []
-              r14 = _nt_atomic
-              s13 << r14
-              if r14
-                r15 = _nt_node_class_declarations
-                s13 << r15
-              end
-              if s13.last
-                r13 = instantiate_node(SyntaxNode,input, i13...index, s13)
-                r13.extend(Primary6)
-                r13.extend(Primary7)
-              else
-                @index = i13
-                r13 = nil
-              end
-              if r13
-                r0 = r13
-              else
-                @index = i0
-                r0 = nil
-              end
-            end
-          end
-        end
-
-        node_cache[:primary][start_index] = r0
-
-        r0
-      end
-
-      module LabeledSequencePrimary0
-        def label
-          elements[0]
-        end
-
-        def sequence_primary
-          elements[1]
-        end
-      end
-
-      module LabeledSequencePrimary1
-        def compile(lexical_address, builder)
-          sequence_primary.compile(lexical_address, builder)
-        end
-    
-        def inline_modules
-          sequence_primary.inline_modules
-        end
-    
-        def label_name
-          if label.name
-            label.name
-          elsif sequence_primary.instance_of?(Nonterminal)
-            sequence_primary.text_value
-          else
-            nil
-          end
-        end
-      end
-
-      def _nt_labeled_sequence_primary
-        start_index = index
-        if node_cache[:labeled_sequence_primary].has_key?(index)
-          cached = node_cache[:labeled_sequence_primary][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        r1 = _nt_label
-        s0 << r1
-        if r1
-          r2 = _nt_sequence_primary
-          s0 << r2
-        end
-        if s0.last
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-          r0.extend(LabeledSequencePrimary0)
-          r0.extend(LabeledSequencePrimary1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:labeled_sequence_primary][start_index] = r0
-
-        r0
-      end
-
-      module Label0
-        def alpha_char
-          elements[0]
-        end
-
-      end
-
-      module Label1
-      end
-
-      module Label2
-        def name
-          elements[0].text_value
-        end
-      end
-
-      module Label3
-        def name
-          nil
-        end
-      end
-
-      def _nt_label
-        start_index = index
-        if node_cache[:label].has_key?(index)
-          cached = node_cache[:label][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        i1, s1 = index, []
-        i2, s2 = index, []
-        r3 = _nt_alpha_char
-        s2 << r3
-        if r3
-          s4, i4 = [], index
-          loop do
-            r5 = _nt_alphanumeric_char
-            if r5
-              s4 << r5
-            else
-              break
-            end
-          end
-          r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
-          s2 << r4
-        end
-        if s2.last
-          r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-          r2.extend(Label0)
-        else
-          @index = i2
-          r2 = nil
-        end
-        s1 << r2
-        if r2
-          if has_terminal?(':', false, index)
-            r6 = instantiate_node(SyntaxNode,input, index...(index + 1))
-            @index += 1
-          else
-            terminal_parse_failure(':')
-            r6 = nil
-          end
-          s1 << r6
-        end
-        if s1.last
-          r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
-          r1.extend(Label1)
-          r1.extend(Label2)
-        else
-          @index = i1
-          r1 = nil
-        end
-        if r1
-          r0 = r1
-        else
-          if has_terminal?('', false, index)
-            r7 = instantiate_node(SyntaxNode,input, index...(index + 0))
-            r7.extend(Label3)
-            @index += 0
-          else
-            terminal_parse_failure('')
-            r7 = nil
-          end
-          if r7
-            r0 = r7
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:label][start_index] = r0
-
-        r0
-      end
-
-      module SequencePrimary0
-        def prefix
-          elements[0]
-        end
-
-        def atomic
-          elements[1]
-        end
-      end
-
-      module SequencePrimary1
-        def compile(lexical_address, builder)
-          prefix.compile(lexical_address, builder, self)
-        end
-    
-        def prefixed_expression
-          elements[1]
-        end
-    
-        def inline_modules
-          atomic.inline_modules
-        end
-    
-        def inline_module_name
-          nil
-        end
-      end
-
-      module SequencePrimary2
-        def prefix
-          elements[0]
-        end
-
-        def predicate_block
-          elements[2]
-        end
-      end
-
-      module SequencePrimary3
-        def compile(address, builder, parent_expression=nil)
-          prefix.compile(address, builder, self)
-        end
-        def prefixed_expression
-          predicate_block
-        end
-        def inline_modules
-          []
-        end
-      end
-
-      module SequencePrimary4
-        def atomic
-          elements[0]
-        end
-
-        def suffix
-          elements[1]
-        end
-      end
-
-      module SequencePrimary5
-        def compile(lexical_address, builder)
-          suffix.compile(lexical_address, builder, self)
-        end
-    
-        def node_class_name
-          nil
-        end
-    
-        def inline_modules
-          atomic.inline_modules
-        end
-    
-        def inline_module_name
-          nil
-        end
-      end
-
-      def _nt_sequence_primary
-        start_index = index
-        if node_cache[:sequence_primary].has_key?(index)
-          cached = node_cache[:sequence_primary][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        i1, s1 = index, []
-        r2 = _nt_prefix
-        s1 << r2
-        if r2
-          r3 = _nt_atomic
-          s1 << r3
-        end
-        if s1.last
-          r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
-          r1.extend(SequencePrimary0)
-          r1.extend(SequencePrimary1)
-        else
-          @index = i1
-          r1 = nil
-        end
-        if r1
-          r0 = r1
-        else
-          i4, s4 = index, []
-          r5 = _nt_prefix
-          s4 << r5
-          if r5
-            r7 = _nt_space
-            if r7
-              r6 = r7
-            else
-              r6 = instantiate_node(SyntaxNode,input, index...index)
-            end
-            s4 << r6
-            if r6
-              r8 = _nt_predicate_block
-              s4 << r8
-            end
-          end
-          if s4.last
-            r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
-            r4.extend(SequencePrimary2)
-            r4.extend(SequencePrimary3)
-          else
-            @index = i4
-            r4 = nil
-          end
-          if r4
-            r0 = r4
-          else
-            i9, s9 = index, []
-            r10 = _nt_atomic
-            s9 << r10
-            if r10
-              r11 = _nt_suffix
-              s9 << r11
-            end
-            if s9.last
-              r9 = instantiate_node(SyntaxNode,input, i9...index, s9)
-              r9.extend(SequencePrimary4)
-              r9.extend(SequencePrimary5)
-            else
-              @index = i9
-              r9 = nil
-            end
-            if r9
-              r0 = r9
-            else
-              r12 = _nt_atomic
-              if r12
-                r0 = r12
-              else
-                @index = i0
-                r0 = nil
-              end
-            end
-          end
-        end
-
-        node_cache[:sequence_primary][start_index] = r0
-
-        r0
-      end
-
-      def _nt_suffix
-        start_index = index
-        if node_cache[:suffix].has_key?(index)
-          cached = node_cache[:suffix][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        r1 = _nt_repetition_suffix
-        if r1
-          r0 = r1
-        else
-          r2 = _nt_optional_suffix
-          if r2
-            r0 = r2
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:suffix][start_index] = r0
-
-        r0
-      end
-
-      def _nt_optional_suffix
-        start_index = index
-        if node_cache[:optional_suffix].has_key?(index)
-          cached = node_cache[:optional_suffix][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        if has_terminal?('?', false, index)
-          r0 = instantiate_node(Optional,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('?')
-          r0 = nil
-        end
-
-        node_cache[:optional_suffix][start_index] = r0
-
-        r0
-      end
-
-      module NodeClassDeclarations0
-        def node_class_expression
-          elements[0]
-        end
-
-        def trailing_inline_module
-          elements[1]
-        end
-      end
-
-      module NodeClassDeclarations1
-        def node_class_name
-          node_class_expression.node_class_name
-        end
-    
-        def inline_modules
-          trailing_inline_module.inline_modules
-        end
-    
-        def inline_module
-          trailing_inline_module.inline_module
-        end
-    
-        def inline_module_name
-          inline_module.module_name if inline_module
-        end
-      end
-
-      def _nt_node_class_declarations
-        start_index = index
-        if node_cache[:node_class_declarations].has_key?(index)
-          cached = node_cache[:node_class_declarations][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        r1 = _nt_node_class_expression
-        s0 << r1
-        if r1
-          r2 = _nt_trailing_inline_module
-          s0 << r2
-        end
-        if s0.last
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-          r0.extend(NodeClassDeclarations0)
-          r0.extend(NodeClassDeclarations1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:node_class_declarations][start_index] = r0
-
-        r0
-      end
-
-      def _nt_repetition_suffix
-        start_index = index
-        if node_cache[:repetition_suffix].has_key?(index)
-          cached = node_cache[:repetition_suffix][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        if has_terminal?('+', false, index)
-          r1 = instantiate_node(OneOrMore,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('+')
-          r1 = nil
-        end
-        if r1
-          r0 = r1
-        else
-          if has_terminal?('*', false, index)
-            r2 = instantiate_node(ZeroOrMore,input, index...(index + 1))
-            @index += 1
-          else
-            terminal_parse_failure('*')
-            r2 = nil
-          end
-          if r2
-            r0 = r2
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:repetition_suffix][start_index] = r0
-
-        r0
-      end
-
-      def _nt_prefix
-        start_index = index
-        if node_cache[:prefix].has_key?(index)
-          cached = node_cache[:prefix][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        if has_terminal?('&', false, index)
-          r1 = instantiate_node(AndPredicate,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('&')
-          r1 = nil
-        end
-        if r1
-          r0 = r1
-        else
-          if has_terminal?('!', false, index)
-            r2 = instantiate_node(NotPredicate,input, index...(index + 1))
-            @index += 1
-          else
-            terminal_parse_failure('!')
-            r2 = nil
-          end
-          if r2
-            r0 = r2
-          else
-            if has_terminal?('~', false, index)
-              r3 = instantiate_node(TransientPrefix,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure('~')
-              r3 = nil
-            end
-            if r3
-              r0 = r3
-            else
-              @index = i0
-              r0 = nil
-            end
-          end
-        end
-
-        node_cache[:prefix][start_index] = r0
-
-        r0
-      end
-
-      def _nt_atomic
-        start_index = index
-        if node_cache[:atomic].has_key?(index)
-          cached = node_cache[:atomic][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        r1 = _nt_terminal
-        if r1
-          r0 = r1
-        else
-          r2 = _nt_nonterminal
-          if r2
-            r0 = r2
-          else
-            r3 = _nt_parenthesized_expression
-            if r3
-              r0 = r3
-            else
-              @index = i0
-              r0 = nil
-            end
-          end
-        end
-
-        node_cache[:atomic][start_index] = r0
-
-        r0
-      end
-
-      module ParenthesizedExpression0
-        def parsing_expression
-          elements[2]
-        end
-
-      end
-
-      module ParenthesizedExpression1
-        def inline_modules
-          parsing_expression.inline_modules
-        end
-      end
-
-      def _nt_parenthesized_expression
-        start_index = index
-        if node_cache[:parenthesized_expression].has_key?(index)
-          cached = node_cache[:parenthesized_expression][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('(', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('(')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          r3 = _nt_space
-          if r3
-            r2 = r3
-          else
-            r2 = instantiate_node(SyntaxNode,input, index...index)
-          end
-          s0 << r2
-          if r2
-            r4 = _nt_parsing_expression
-            s0 << r4
-            if r4
-              r6 = _nt_space
-              if r6
-                r5 = r6
-              else
-                r5 = instantiate_node(SyntaxNode,input, index...index)
-              end
-              s0 << r5
-              if r5
-                if has_terminal?(')', false, index)
-                  r7 = instantiate_node(SyntaxNode,input, index...(index + 1))
-                  @index += 1
-                else
-                  terminal_parse_failure(')')
-                  r7 = nil
-                end
-                s0 << r7
-              end
-            end
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(ParenthesizedExpression,input, i0...index, s0)
-          r0.extend(ParenthesizedExpression0)
-          r0.extend(ParenthesizedExpression1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:parenthesized_expression][start_index] = r0
-
-        r0
-      end
-
-      module Nonterminal0
-        def alpha_char
-          elements[0]
-        end
-
-      end
-
-      module Nonterminal1
-      end
-
-      def _nt_nonterminal
-        start_index = index
-        if node_cache[:nonterminal].has_key?(index)
-          cached = node_cache[:nonterminal][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        i1 = index
-        r2 = _nt_keyword_inside_grammar
-        if r2
-          r1 = nil
-        else
-          @index = i1
-          r1 = instantiate_node(SyntaxNode,input, index...index)
-        end
-        s0 << r1
-        if r1
-          i3, s3 = index, []
-          r4 = _nt_alpha_char
-          s3 << r4
-          if r4
-            s5, i5 = [], index
-            loop do
-              r6 = _nt_alphanumeric_char
-              if r6
-                s5 << r6
-              else
-                break
-              end
-            end
-            r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
-            s3 << r5
-          end
-          if s3.last
-            r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
-            r3.extend(Nonterminal0)
-          else
-            @index = i3
-            r3 = nil
-          end
-          s0 << r3
-        end
-        if s0.last
-          r0 = instantiate_node(Nonterminal,input, i0...index, s0)
-          r0.extend(Nonterminal1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:nonterminal][start_index] = r0
-
-        r0
-      end
-
-      def _nt_terminal
-        start_index = index
-        if node_cache[:terminal].has_key?(index)
-          cached = node_cache[:terminal][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        r1 = _nt_quoted_string
-        if r1
-          r0 = r1
-        else
-          r2 = _nt_character_class
-          if r2
-            r0 = r2
-          else
-            r3 = _nt_anything_symbol
-            if r3
-              r0 = r3
-            else
-              @index = i0
-              r0 = nil
-            end
-          end
-        end
-
-        node_cache[:terminal][start_index] = r0
-
-        r0
-      end
-
-      module QuotedString0
-        def string
-          super.text_value
-        end
-      end
-
-      def _nt_quoted_string
-        start_index = index
-        if node_cache[:quoted_string].has_key?(index)
-          cached = node_cache[:quoted_string][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        r1 = _nt_single_quoted_string
-        if r1
-          r0 = r1
-          r0.extend(QuotedString0)
-        else
-          r2 = _nt_double_quoted_string
-          if r2
-            r0 = r2
-            r0.extend(QuotedString0)
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:quoted_string][start_index] = r0
-
-        r0
-      end
-
-      module DoubleQuotedString0
-      end
-
-      module DoubleQuotedString1
-        def string
-          elements[1]
-        end
-
-      end
-
-      def _nt_double_quoted_string
-        start_index = index
-        if node_cache[:double_quoted_string].has_key?(index)
-          cached = node_cache[:double_quoted_string][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('"', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('"')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          s2, i2 = [], index
-          loop do
-            i3, s3 = index, []
-            i4 = index
-            if has_terminal?('"', false, index)
-              r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure('"')
-              r5 = nil
-            end
-            if r5
-              r4 = nil
-            else
-              @index = i4
-              r4 = instantiate_node(SyntaxNode,input, index...index)
-            end
-            s3 << r4
-            if r4
-              i6 = index
-              if has_terminal?("\\\\", false, index)
-                r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
-                @index += 2
-              else
-                terminal_parse_failure("\\\\")
-                r7 = nil
-              end
-              if r7
-                r6 = r7
-              else
-                if has_terminal?('\"', false, index)
-                  r8 = instantiate_node(SyntaxNode,input, index...(index + 2))
-                  @index += 2
-                else
-                  terminal_parse_failure('\"')
-                  r8 = nil
-                end
-                if r8
-                  r6 = r8
-                else
-                  if index < input_length
-                    next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                    r9 = instantiate_node(SyntaxNode,input, index...next_character)
-                    @index = next_character
-                  else
-                    terminal_parse_failure("any character")
-                    r9 = nil
-                  end
-                  if r9
-                    r6 = r9
-                  else
-                    @index = i6
-                    r6 = nil
-                  end
-                end
-              end
-              s3 << r6
-            end
-            if s3.last
-              r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
-              r3.extend(DoubleQuotedString0)
-            else
-              @index = i3
-              r3 = nil
-            end
-            if r3
-              s2 << r3
-            else
-              break
-            end
-          end
-          r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-          s0 << r2
-          if r2
-            if has_terminal?('"', false, index)
-              r10 = instantiate_node(SyntaxNode,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure('"')
-              r10 = nil
-            end
-            s0 << r10
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(Terminal,input, i0...index, s0)
-          r0.extend(DoubleQuotedString1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:double_quoted_string][start_index] = r0
-
-        r0
-      end
-
-      module SingleQuotedString0
-      end
-
-      module SingleQuotedString1
-        def string
-          elements[1]
-        end
-
-      end
-
-      def _nt_single_quoted_string
-        start_index = index
-        if node_cache[:single_quoted_string].has_key?(index)
-          cached = node_cache[:single_quoted_string][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?("'", false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure("'")
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          s2, i2 = [], index
-          loop do
-            i3, s3 = index, []
-            i4 = index
-            if has_terminal?("'", false, index)
-              r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure("'")
-              r5 = nil
-            end
-            if r5
-              r4 = nil
-            else
-              @index = i4
-              r4 = instantiate_node(SyntaxNode,input, index...index)
-            end
-            s3 << r4
-            if r4
-              i6 = index
-              if has_terminal?("\\\\", false, index)
-                r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
-                @index += 2
-              else
-                terminal_parse_failure("\\\\")
-                r7 = nil
-              end
-              if r7
-                r6 = r7
-              else
-                if has_terminal?("\\'", false, index)
-                  r8 = instantiate_node(SyntaxNode,input, index...(index + 2))
-                  @index += 2
-                else
-                  terminal_parse_failure("\\'")
-                  r8 = nil
-                end
-                if r8
-                  r6 = r8
-                else
-                  if index < input_length
-                    next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                    r9 = instantiate_node(SyntaxNode,input, index...next_character)
-                    @index = next_character
-                  else
-                    terminal_parse_failure("any character")
-                    r9 = nil
-                  end
-                  if r9
-                    r6 = r9
-                  else
-                    @index = i6
-                    r6 = nil
-                  end
-                end
-              end
-              s3 << r6
-            end
-            if s3.last
-              r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
-              r3.extend(SingleQuotedString0)
-            else
-              @index = i3
-              r3 = nil
-            end
-            if r3
-              s2 << r3
-            else
-              break
-            end
-          end
-          r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-          s0 << r2
-          if r2
-            if has_terminal?("'", false, index)
-              r10 = instantiate_node(SyntaxNode,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure("'")
-              r10 = nil
-            end
-            s0 << r10
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(Terminal,input, i0...index, s0)
-          r0.extend(SingleQuotedString1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:single_quoted_string][start_index] = r0
-
-        r0
-      end
-
-      module CharacterClass0
-      end
-
-      module CharacterClass1
-      end
-
-      module CharacterClass2
-      end
-
-      module CharacterClass3
-        def characters
-          elements[1]
-        end
-
-      end
-
-      module CharacterClass4
-        def characters
-          super.text_value
-        end
-      end
-
-      def _nt_character_class
-        start_index = index
-        if node_cache[:character_class].has_key?(index)
-          cached = node_cache[:character_class][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('[', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('[')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          s2, i2 = [], index
-          loop do
-            i3, s3 = index, []
-            i4 = index
-            if has_terminal?(']', false, index)
-              r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure(']')
-              r5 = nil
-            end
-            if r5
-              r4 = nil
-            else
-              @index = i4
-              r4 = instantiate_node(SyntaxNode,input, index...index)
-            end
-            s3 << r4
-            if r4
-              i6 = index
-              i7, s7 = index, []
-              if has_terminal?('\\', false, index)
-                r8 = instantiate_node(SyntaxNode,input, index...(index + 1))
-                @index += 1
-              else
-                terminal_parse_failure('\\')
-                r8 = nil
-              end
-              s7 << r8
-              if r8
-                if index < input_length
-                  next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                  r9 = instantiate_node(SyntaxNode,input, index...next_character)
-                  @index = next_character
-                else
-                  terminal_parse_failure("any character")
-                  r9 = nil
-                end
-                s7 << r9
-              end
-              if s7.last
-                r7 = instantiate_node(SyntaxNode,input, i7...index, s7)
-                r7.extend(CharacterClass0)
-              else
-                @index = i7
-                r7 = nil
-              end
-              if r7
-                r6 = r7
-              else
-                i10, s10 = index, []
-                i11 = index
-                if has_terminal?('\\', false, index)
-                  r12 = instantiate_node(SyntaxNode,input, index...(index + 1))
-                  @index += 1
-                else
-                  terminal_parse_failure('\\')
-                  r12 = nil
-                end
-                if r12
-                  r11 = nil
-                else
-                  @index = i11
-                  r11 = instantiate_node(SyntaxNode,input, index...index)
-                end
-                s10 << r11
-                if r11
-                  if index < input_length
-                    next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                    r13 = instantiate_node(SyntaxNode,input, index...next_character)
-                    @index = next_character
-                  else
-                    terminal_parse_failure("any character")
-                    r13 = nil
-                  end
-                  s10 << r13
-                end
-                if s10.last
-                  r10 = instantiate_node(SyntaxNode,input, i10...index, s10)
-                  r10.extend(CharacterClass1)
-                else
-                  @index = i10
-                  r10 = nil
-                end
-                if r10
-                  r6 = r10
-                else
-                  @index = i6
-                  r6 = nil
-                end
-              end
-              s3 << r6
-            end
-            if s3.last
-              r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
-              r3.extend(CharacterClass2)
-            else
-              @index = i3
-              r3 = nil
-            end
-            if r3
-              s2 << r3
-            else
-              break
-            end
-          end
-          if s2.empty?
-            @index = i2
-            r2 = nil
-          else
-            r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-          end
-          s0 << r2
-          if r2
-            if has_terminal?(']', false, index)
-              r14 = instantiate_node(SyntaxNode,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure(']')
-              r14 = nil
-            end
-            s0 << r14
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(CharacterClass,input, i0...index, s0)
-          r0.extend(CharacterClass3)
-          r0.extend(CharacterClass4)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:character_class][start_index] = r0
-
-        r0
-      end
-
-      def _nt_anything_symbol
-        start_index = index
-        if node_cache[:anything_symbol].has_key?(index)
-          cached = node_cache[:anything_symbol][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        if has_terminal?('.', false, index)
-          r0 = instantiate_node(AnythingSymbol,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('.')
-          r0 = nil
-        end
-
-        node_cache[:anything_symbol][start_index] = r0
-
-        r0
-      end
-
-      module NodeClassExpression0
-      end
-
-      module NodeClassExpression1
-        def space
-          elements[0]
-        end
-
-      end
-
-      module NodeClassExpression2
-        def node_class_name
-          elements[2].text_value
-        end
-      end
-
-      module NodeClassExpression3
-        def node_class_name
-          nil
-        end
-      end
-
-      def _nt_node_class_expression
-        start_index = index
-        if node_cache[:node_class_expression].has_key?(index)
-          cached = node_cache[:node_class_expression][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        i1, s1 = index, []
-        r2 = _nt_space
-        s1 << r2
-        if r2
-          if has_terminal?('<', false, index)
-            r3 = instantiate_node(SyntaxNode,input, index...(index + 1))
-            @index += 1
-          else
-            terminal_parse_failure('<')
-            r3 = nil
-          end
-          s1 << r3
-          if r3
-            s4, i4 = [], index
-            loop do
-              i5, s5 = index, []
-              i6 = index
-              if has_terminal?('>', false, index)
-                r7 = instantiate_node(SyntaxNode,input, index...(index + 1))
-                @index += 1
-              else
-                terminal_parse_failure('>')
-                r7 = nil
-              end
-              if r7
-                r6 = nil
-              else
-                @index = i6
-                r6 = instantiate_node(SyntaxNode,input, index...index)
-              end
-              s5 << r6
-              if r6
-                if index < input_length
-                  next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                  r8 = instantiate_node(SyntaxNode,input, index...next_character)
-                  @index = next_character
-                else
-                  terminal_parse_failure("any character")
-                  r8 = nil
-                end
-                s5 << r8
-              end
-              if s5.last
-                r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
-                r5.extend(NodeClassExpression0)
-              else
-                @index = i5
-                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
-            s1 << r4
-            if r4
-              if has_terminal?('>', false, index)
-                r9 = instantiate_node(SyntaxNode,input, index...(index + 1))
-                @index += 1
-              else
-                terminal_parse_failure('>')
-                r9 = nil
-              end
-              s1 << r9
-            end
-          end
-        end
-        if s1.last
-          r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
-          r1.extend(NodeClassExpression1)
-          r1.extend(NodeClassExpression2)
-        else
-          @index = i1
-          r1 = nil
-        end
-        if r1
-          r0 = r1
-        else
-          if has_terminal?('', false, index)
-            r10 = instantiate_node(SyntaxNode,input, index...(index + 0))
-            r10.extend(NodeClassExpression3)
-            @index += 0
-          else
-            terminal_parse_failure('')
-            r10 = nil
-          end
-          if r10
-            r0 = r10
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:node_class_expression][start_index] = r0
-
-        r0
-      end
-
-      module TrailingInlineModule0
-        def space
-          elements[0]
-        end
-
-        def inline_module
-          elements[1]
-        end
-      end
-
-      module TrailingInlineModule1
-        def inline_modules
-          [inline_module]
-        end
-              
-        def inline_module_name
-          inline_module.module_name
-        end
-      end
-
-      module TrailingInlineModule2
-        def inline_modules
-          []
-        end
-    
-        def inline_module
-          nil 
-        end
-    
-        def inline_module_name
-          nil
-        end
-      end
-
-      def _nt_trailing_inline_module
-        start_index = index
-        if node_cache[:trailing_inline_module].has_key?(index)
-          cached = node_cache[:trailing_inline_module][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        i1, s1 = index, []
-        r2 = _nt_space
-        s1 << r2
-        if r2
-          r3 = _nt_inline_module
-          s1 << r3
-        end
-        if s1.last
-          r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
-          r1.extend(TrailingInlineModule0)
-          r1.extend(TrailingInlineModule1)
-        else
-          @index = i1
-          r1 = nil
-        end
-        if r1
-          r0 = r1
-        else
-          if has_terminal?('', false, index)
-            r4 = instantiate_node(SyntaxNode,input, index...(index + 0))
-            r4.extend(TrailingInlineModule2)
-            @index += 0
-          else
-            terminal_parse_failure('')
-            r4 = nil
-          end
-          if r4
-            r0 = r4
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:trailing_inline_module][start_index] = r0
-
-        r0
-      end
-
-      module PredicateBlock0
-        def inline_module
-          elements[1]
-        end
-      end
-
-      def _nt_predicate_block
-        start_index = index
-        if node_cache[:predicate_block].has_key?(index)
-          cached = node_cache[:predicate_block][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 0))
-          @index += 0
-        else
-          terminal_parse_failure('')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          r2 = _nt_inline_module
-          s0 << r2
-        end
-        if s0.last
-          r0 = instantiate_node(PredicateBlock,input, i0...index, s0)
-          r0.extend(PredicateBlock0)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:predicate_block][start_index] = r0
-
-        r0
-      end
-
-      module InlineModule0
-      end
-
-      module InlineModule1
-      end
-
-      def _nt_inline_module
-        start_index = index
-        if node_cache[:inline_module].has_key?(index)
-          cached = node_cache[:inline_module][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('{', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('{')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          s2, i2 = [], index
-          loop do
-            i3 = index
-            r4 = _nt_inline_module
-            if r4
-              r3 = r4
-            else
-              i5, s5 = index, []
-              i6 = index
-              if has_terminal?('\G[{}]', true, index)
-                next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                r7 = true
-                @index = next_character
-              else
-                r7 = nil
-              end
-              if r7
-                r6 = nil
-              else
-                @index = i6
-                r6 = instantiate_node(SyntaxNode,input, index...index)
-              end
-              s5 << r6
-              if r6
-                if index < input_length
-                  next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                  r8 = instantiate_node(SyntaxNode,input, index...next_character)
-                  @index = next_character
-                else
-                  terminal_parse_failure("any character")
-                  r8 = nil
-                end
-                s5 << r8
-              end
-              if s5.last
-                r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
-                r5.extend(InlineModule0)
-              else
-                @index = i5
-                r5 = nil
-              end
-              if r5
-                r3 = r5
-              else
-                @index = i3
-                r3 = nil
-              end
-            end
-            if r3
-              s2 << r3
-            else
-              break
-            end
-          end
-          r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-          s0 << r2
-          if r2
-            if has_terminal?('}', false, index)
-              r9 = instantiate_node(SyntaxNode,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure('}')
-              r9 = nil
-            end
-            s0 << r9
-          end
-        end
-        if s0.last
-          r0 = instantiate_node(InlineModule,input, i0...index, s0)
-          r0.extend(InlineModule1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:inline_module][start_index] = r0
-
-        r0
-      end
-
-      module KeywordInsideGrammar0
-      end
-
-      def _nt_keyword_inside_grammar
-        start_index = index
-        if node_cache[:keyword_inside_grammar].has_key?(index)
-          cached = node_cache[:keyword_inside_grammar][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        i1 = index
-        if has_terminal?('rule', false, index)
-          r2 = instantiate_node(SyntaxNode,input, index...(index + 4))
-          @index += 4
-        else
-          terminal_parse_failure('rule')
-          r2 = nil
-        end
-        if r2
-          r1 = r2
-        else
-          if has_terminal?('end', false, index)
-            r3 = instantiate_node(SyntaxNode,input, index...(index + 3))
-            @index += 3
-          else
-            terminal_parse_failure('end')
-            r3 = nil
-          end
-          if r3
-            r1 = r3
-          else
-            @index = i1
-            r1 = nil
-          end
-        end
-        s0 << r1
-        if r1
-          i4 = index
-          r5 = _nt_non_space_char
-          if r5
-            r4 = nil
-          else
-            @index = i4
-            r4 = instantiate_node(SyntaxNode,input, index...index)
-          end
-          s0 << r4
-        end
-        if s0.last
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-          r0.extend(KeywordInsideGrammar0)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:keyword_inside_grammar][start_index] = r0
-
-        r0
-      end
-
-      module NonSpaceChar0
-      end
-
-      def _nt_non_space_char
-        start_index = index
-        if node_cache[:non_space_char].has_key?(index)
-          cached = node_cache[:non_space_char][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        i1 = index
-        r2 = _nt_space
-        if r2
-          r1 = nil
-        else
-          @index = i1
-          r1 = instantiate_node(SyntaxNode,input, index...index)
-        end
-        s0 << r1
-        if r1
-          if index < input_length
-            next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-            r3 = instantiate_node(SyntaxNode,input, index...next_character)
-            @index = next_character
-          else
-            terminal_parse_failure("any character")
-            r3 = nil
-          end
-          s0 << r3
-        end
-        if s0.last
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-          r0.extend(NonSpaceChar0)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:non_space_char][start_index] = r0
-
-        r0
-      end
-
-      def _nt_alpha_char
-        start_index = index
-        if node_cache[:alpha_char].has_key?(index)
-          cached = node_cache[:alpha_char][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        if has_terminal?('\G[A-Za-z_]', true, index)
-          next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-          r0 = instantiate_node(SyntaxNode, input, index...next_character)
-          @index = next_character
-        else
-          r0 = nil
-        end
-
-        node_cache[:alpha_char][start_index] = r0
-
-        r0
-      end
-
-      def _nt_alphanumeric_char
-        start_index = index
-        if node_cache[:alphanumeric_char].has_key?(index)
-          cached = node_cache[:alphanumeric_char][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0 = index
-        r1 = _nt_alpha_char
-        if r1
-          r0 = r1
-        else
-          if has_terminal?('\G[0-9]', true, index)
-            next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-            r2 = true
-            @index = next_character
-          else
-            r2 = nil
-          end
-          if r2
-            r0 = r2
-          else
-            @index = i0
-            r0 = nil
-          end
-        end
-
-        node_cache[:alphanumeric_char][start_index] = r0
-
-        r0
-      end
-
-      def _nt_space
-        start_index = index
-        if node_cache[:space].has_key?(index)
-          cached = node_cache[:space][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        s0, i0 = [], index
-        loop do
-          i1 = index
-          r2 = _nt_white
-          if r2
-            r1 = r2
-          else
-            r3 = _nt_comment_to_eol
-            if r3
-              r1 = r3
-            else
-              @index = i1
-              r1 = nil
-            end
-          end
-          if r1
-            s0 << r1
-          else
-            break
-          end
-        end
-        if s0.empty?
-          @index = i0
-          r0 = nil
-        else
-          r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-        end
-
-        node_cache[:space][start_index] = r0
-
-        r0
-      end
-
-      module CommentToEol0
-      end
-
-      module CommentToEol1
-      end
-
-      def _nt_comment_to_eol
-        start_index = index
-        if node_cache[:comment_to_eol].has_key?(index)
-          cached = node_cache[:comment_to_eol][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        i0, s0 = index, []
-        if has_terminal?('#', false, index)
-          r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
-          @index += 1
-        else
-          terminal_parse_failure('#')
-          r1 = nil
-        end
-        s0 << r1
-        if r1
-          s2, i2 = [], index
-          loop do
-            i3, s3 = index, []
-            i4 = index
-            if has_terminal?("\n", false, index)
-              r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
-              @index += 1
-            else
-              terminal_parse_failure("\n")
-              r5 = nil
-            end
-            if r5
-              r4 = nil
-            else
-              @index = i4
-              r4 = instantiate_node(SyntaxNode,input, index...index)
-            end
-            s3 << r4
-            if r4
-              if index < input_length
-                next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-                r6 = instantiate_node(SyntaxNode,input, index...next_character)
-                @index = next_character
-              else
-                terminal_parse_failure("any character")
-                r6 = nil
-              end
-              s3 << r6
-            end
-            if s3.last
-              r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
-              r3.extend(CommentToEol0)
-            else
-              @index = i3
-              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(SyntaxNode,input, i0...index, s0)
-          r0.extend(CommentToEol1)
-        else
-          @index = i0
-          r0 = nil
-        end
-
-        node_cache[:comment_to_eol][start_index] = r0
-
-        r0
-      end
-
-      def _nt_white
-        start_index = index
-        if node_cache[:white].has_key?(index)
-          cached = node_cache[:white][index]
-          @index = cached.interval.end if cached
-          return cached
-        end
-
-        if has_terminal?('\G[ \\t\\n\\r]', true, index)
-          next_character = index + input[index..-1].match(/\A(.)/um).end(1)
-          r0 = instantiate_node(SyntaxNode, input, index...next_character)
-          @index = next_character
-        else
-          r0 = nil
-        end
-
-        node_cache[:white][start_index] = r0
-
-        r0
-      end
-
-    end
-
-    class MetagrammarParser < Treetop::Runtime::CompiledParser
-      include Metagrammar
-    end
-
-  end
-end