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
self.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
self.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
self.index = i0
r0 = nil
end
node_cache[:treetop_file][start_index] = r0
return r0
end