# # DO NOT MODIFY!!!! # This file is automatically generated by Racc 1.8.1 # from Racc grammar file "parser.y". # ###### racc/parser.rb begin unless $".find {|p| p.end_with?('/racc/parser.rb')} $".push "#{__dir__}/racc/parser.rb" self.class.module_eval(<<'...end racc/parser.rb/module_eval...', 'racc/parser.rb', 1) #-- # Copyright (c) 1999-2006 Minero Aoki # # This program is free software. # You can distribute/modify this program under the same terms of ruby. # # As a special exception, when this code is copied by Racc # into a Racc output file, you may use that output file # without restriction. #++ unless $".find {|p| p.end_with?('/racc/info.rb')} $".push "#{__dir__}/racc/info.rb" module Racc VERSION = '1.8.1' Version = VERSION Copyright = 'Copyright (c) 1999-2006 Minero Aoki' end end module Racc class ParseError < StandardError; end end unless defined?(::ParseError) ParseError = Racc::ParseError # :nodoc: end # Racc is an LALR(1) parser generator. # It is written in Ruby itself, and generates Ruby programs. # # == Command-line Reference # # racc [-ofilename] [--output-file=filename] # [-erubypath] [--executable=rubypath] # [-v] [--verbose] # [-Ofilename] [--log-file=filename] # [-g] [--debug] # [-E] [--embedded] # [-l] [--no-line-convert] # [-c] [--line-convert-all] # [-a] [--no-omit-actions] # [-C] [--check-only] # [-S] [--output-status] # [--version] [--copyright] [--help] grammarfile # # [+grammarfile+] # Racc grammar file. Any extension is permitted. # [-o+outfile+, --output-file=+outfile+] # A filename for output. default is <+filename+>.tab.rb # [-O+filename+, --log-file=+filename+] # Place logging output in file +filename+. # Default log file name is <+filename+>.output. # [-e+rubypath+, --executable=+rubypath+] # output executable file(mode 755). where +path+ is the Ruby interpreter. # [-v, --verbose] # verbose mode. create +filename+.output file, like yacc's y.output file. # [-g, --debug] # add debug code to parser class. To display debugging information, # use this '-g' option and set @yydebug true in parser class. # [-E, --embedded] # Output parser which doesn't need runtime files (racc/parser.rb). # [-F, --frozen] # Output parser which declares frozen_string_literals: true # [-C, --check-only] # Check syntax of racc grammar file and quit. # [-S, --output-status] # Print messages time to time while compiling. # [-l, --no-line-convert] # turns off line number converting. # [-c, --line-convert-all] # Convert line number of actions, inner, header and footer. # [-a, --no-omit-actions] # Call all actions, even if an action is empty. # [--version] # print Racc version and quit. # [--copyright] # Print copyright and quit. # [--help] # Print usage and quit. # # == Generating Parser Using Racc # # To compile Racc grammar file, simply type: # # $ racc parse.y # # This creates Ruby script file "parse.tab.y". The -o option can change the output filename. # # == Writing A Racc Grammar File # # If you want your own parser, you have to write a grammar file. # A grammar file contains the name of your parser class, grammar for the parser, # user code, and anything else. # When writing a grammar file, yacc's knowledge is helpful. # If you have not used yacc before, Racc is not too difficult. # # Here's an example Racc grammar file. # # class Calcparser # rule # target: exp { print val[0] } # # exp: exp '+' exp # | exp '*' exp # | '(' exp ')' # | NUMBER # end # # Racc grammar files resemble yacc files. # But (of course), this is Ruby code. # yacc's $$ is the 'result', $0, $1... is # an array called 'val', and $-1, $-2... is an array called '_values'. # # See the {Grammar File Reference}[rdoc-ref:lib/racc/rdoc/grammar.en.rdoc] for # more information on grammar files. # # == Parser # # Then you must prepare the parse entry method. There are two types of # parse methods in Racc, Racc::Parser#do_parse and Racc::Parser#yyparse # # Racc::Parser#do_parse is simple. # # It's yyparse() of yacc, and Racc::Parser#next_token is yylex(). # This method must returns an array like [TOKENSYMBOL, ITS_VALUE]. # EOF is [false, false]. # (TOKENSYMBOL is a Ruby symbol (taken from String#intern) by default. # If you want to change this, see the grammar reference. # # Racc::Parser#yyparse is little complicated, but useful. # It does not use Racc::Parser#next_token, instead it gets tokens from any iterator. # # For example, yyparse(obj, :scan) causes # calling +obj#scan+, and you can return tokens by yielding them from +obj#scan+. # # == Debugging # # When debugging, "-v" or/and the "-g" option is helpful. # # "-v" creates verbose log file (.output). # "-g" creates a "Verbose Parser". # Verbose Parser prints the internal status when parsing. # But it's _not_ automatic. # You must use -g option and set +@yydebug+ to +true+ in order to get output. # -g option only creates the verbose parser. # # === Racc reported syntax error. # # Isn't there too many "end"? # grammar of racc file is changed in v0.10. # # Racc does not use '%' mark, while yacc uses huge number of '%' marks.. # # === Racc reported "XXXX conflicts". # # Try "racc -v xxxx.y". # It causes producing racc's internal log file, xxxx.output. # # === Generated parsers does not work correctly # # Try "racc -g xxxx.y". # This command let racc generate "debugging parser". # Then set @yydebug=true in your parser. # It produces a working log of your parser. # # == Re-distributing Racc runtime # # A parser, which is created by Racc, requires the Racc runtime module; # racc/parser.rb. # # Ruby 1.8.x comes with Racc runtime module, # you need NOT distribute Racc runtime files. # # If you want to include the Racc runtime module with your parser. # This can be done by using '-E' option: # # $ racc -E -omyparser.rb myparser.y # # This command creates myparser.rb which `includes' Racc runtime. # Only you must do is to distribute your parser file (myparser.rb). # # Note: parser.rb is ruby license, but your parser is not. # Your own parser is completely yours. module Racc unless defined?(Racc_No_Extensions) Racc_No_Extensions = false # :nodoc: end class Parser Racc_Runtime_Version = ::Racc::VERSION Racc_Runtime_Core_Version_R = ::Racc::VERSION begin if Object.const_defined?(:RUBY_ENGINE) and RUBY_ENGINE == 'jruby' require 'jruby' require 'racc/cparse-jruby.jar' com.headius.racc.Cparse.new.load(JRuby.runtime, false) else require 'racc/cparse' end unless new.respond_to?(:_racc_do_parse_c, true) raise LoadError, 'old cparse.so' end if Racc_No_Extensions raise LoadError, 'selecting ruby version of racc runtime core' end Racc_Main_Parsing_Routine = :_racc_do_parse_c # :nodoc: Racc_YY_Parse_Method = :_racc_yyparse_c # :nodoc: Racc_Runtime_Core_Version = Racc_Runtime_Core_Version_C # :nodoc: Racc_Runtime_Type = 'c' # :nodoc: rescue LoadError Racc_Main_Parsing_Routine = :_racc_do_parse_rb Racc_YY_Parse_Method = :_racc_yyparse_rb Racc_Runtime_Core_Version = Racc_Runtime_Core_Version_R Racc_Runtime_Type = 'ruby' end def Parser.racc_runtime_type # :nodoc: Racc_Runtime_Type end def _racc_setup @yydebug = false unless self.class::Racc_debug_parser @yydebug = false unless defined?(@yydebug) if @yydebug @racc_debug_out = $stderr unless defined?(@racc_debug_out) @racc_debug_out ||= $stderr end arg = self.class::Racc_arg arg[13] = true if arg.size < 14 arg end def _racc_init_sysvars @racc_state = [0] @racc_tstack = [] @racc_vstack = [] @racc_t = nil @racc_val = nil @racc_read_next = true @racc_user_yyerror = false @racc_error_status = 0 end # The entry point of the parser. This method is used with #next_token. # If Racc wants to get token (and its value), calls next_token. # # Example: # def parse # @q = [[1,1], # [2,2], # [3,3], # [false, '$']] # do_parse # end # # def next_token # @q.shift # end class_eval <<~RUBY, __FILE__, __LINE__ + 1 def do_parse #{Racc_Main_Parsing_Routine}(_racc_setup(), false) end RUBY # The method to fetch next token. # If you use #do_parse method, you must implement #next_token. # # The format of return value is [TOKEN_SYMBOL, VALUE]. # +token-symbol+ is represented by Ruby's symbol by default, e.g. :IDENT # for 'IDENT'. ";" (String) for ';'. # # The final symbol (End of file) must be false. def next_token raise NotImplementedError, "#{self.class}\#next_token is not defined" end def _racc_do_parse_rb(arg, in_debug) action_table, action_check, action_default, action_pointer, _, _, _, _, _, _, token_table, * = arg _racc_init_sysvars tok = act = i = nil catch(:racc_end_parse) { while true if i = action_pointer[@racc_state[-1]] if @racc_read_next if @racc_t != 0 # not EOF tok, @racc_val = next_token() unless tok # EOF @racc_t = 0 else @racc_t = (token_table[tok] or 1) # error token end racc_read_token(@racc_t, tok, @racc_val) if @yydebug @racc_read_next = false end end i += @racc_t unless i >= 0 and act = action_table[i] and action_check[i] == @racc_state[-1] act = action_default[@racc_state[-1]] end else act = action_default[@racc_state[-1]] end while act = _racc_evalact(act, arg) ; end end } end # Another entry point for the parser. # If you use this method, you must implement RECEIVER#METHOD_ID method. # # RECEIVER#METHOD_ID is a method to get next token. # It must 'yield' the token, which format is [TOKEN-SYMBOL, VALUE]. class_eval <<~RUBY, __FILE__, __LINE__ + 1 def yyparse(recv, mid) #{Racc_YY_Parse_Method}(recv, mid, _racc_setup(), false) end RUBY def _racc_yyparse_rb(recv, mid, arg, c_debug) action_table, action_check, action_default, action_pointer, _, _, _, _, _, _, token_table, * = arg _racc_init_sysvars catch(:racc_end_parse) { until i = action_pointer[@racc_state[-1]] while act = _racc_evalact(action_default[@racc_state[-1]], arg) ; end end recv.__send__(mid) do |tok, val| unless tok @racc_t = 0 else @racc_t = (token_table[tok] or 1) # error token end @racc_val = val @racc_read_next = false i += @racc_t unless i >= 0 and act = action_table[i] and action_check[i] == @racc_state[-1] act = action_default[@racc_state[-1]] end while act = _racc_evalact(act, arg) ; end while !(i = action_pointer[@racc_state[-1]]) || ! @racc_read_next || @racc_t == 0 # $ unless i and i += @racc_t and i >= 0 and act = action_table[i] and action_check[i] == @racc_state[-1] act = action_default[@racc_state[-1]] end while act = _racc_evalact(act, arg) ; end end end } end ### ### common ### def _racc_evalact(act, arg) action_table, action_check, _, action_pointer, _, _, _, _, _, _, _, shift_n, reduce_n, * = arg nerr = 0 # tmp if act > 0 and act < shift_n # # shift # if @racc_error_status > 0 @racc_error_status -= 1 unless @racc_t <= 1 # error token or EOF end @racc_vstack.push @racc_val @racc_state.push act @racc_read_next = true if @yydebug @racc_tstack.push @racc_t racc_shift @racc_t, @racc_tstack, @racc_vstack end elsif act < 0 and act > -reduce_n # # reduce # code = catch(:racc_jump) { @racc_state.push _racc_do_reduce(arg, act) false } if code case code when 1 # yyerror @racc_user_yyerror = true # user_yyerror return -reduce_n when 2 # yyaccept return shift_n else raise '[Racc Bug] unknown jump code' end end elsif act == shift_n # # accept # racc_accept if @yydebug throw :racc_end_parse, @racc_vstack[0] elsif act == -reduce_n # # error # case @racc_error_status when 0 unless arg[21] # user_yyerror nerr += 1 on_error @racc_t, @racc_val, @racc_vstack end when 3 if @racc_t == 0 # is $ # We're at EOF, and another error occurred immediately after # attempting auto-recovery throw :racc_end_parse, nil end @racc_read_next = true end @racc_user_yyerror = false @racc_error_status = 3 while true if i = action_pointer[@racc_state[-1]] i += 1 # error token if i >= 0 and (act = action_table[i]) and action_check[i] == @racc_state[-1] break end end throw :racc_end_parse, nil if @racc_state.size <= 1 @racc_state.pop @racc_vstack.pop if @yydebug @racc_tstack.pop racc_e_pop @racc_state, @racc_tstack, @racc_vstack end end return act else raise "[Racc Bug] unknown action #{act.inspect}" end racc_next_state(@racc_state[-1], @racc_state) if @yydebug nil end def _racc_do_reduce(arg, act) _, _, _, _, goto_table, goto_check, goto_default, goto_pointer, nt_base, reduce_table, _, _, _, use_result, * = arg state = @racc_state vstack = @racc_vstack tstack = @racc_tstack i = act * -3 len = reduce_table[i] reduce_to = reduce_table[i+1] method_id = reduce_table[i+2] void_array = [] tmp_t = tstack[-len, len] if @yydebug tmp_v = vstack[-len, len] tstack[-len, len] = void_array if @yydebug vstack[-len, len] = void_array state[-len, len] = void_array # tstack must be updated AFTER method call if use_result vstack.push __send__(method_id, tmp_v, vstack, tmp_v[0]) else vstack.push __send__(method_id, tmp_v, vstack) end tstack.push reduce_to racc_reduce(tmp_t, reduce_to, tstack, vstack) if @yydebug k1 = reduce_to - nt_base if i = goto_pointer[k1] i += state[-1] if i >= 0 and (curstate = goto_table[i]) and goto_check[i] == k1 return curstate end end goto_default[k1] end # This method is called when a parse error is found. # # ERROR_TOKEN_ID is an internal ID of token which caused error. # You can get string representation of this ID by calling # #token_to_str. # # ERROR_VALUE is a value of error token. # # value_stack is a stack of symbol values. # DO NOT MODIFY this object. # # This method raises ParseError by default. # # If this method returns, parsers enter "error recovering mode". def on_error(t, val, vstack) raise ParseError, sprintf("parse error on value %s (%s)", val.inspect, token_to_str(t) || '?') end # Enter error recovering mode. # This method does not call #on_error. def yyerror throw :racc_jump, 1 end # Exit parser. # Return value is +Symbol_Value_Stack[0]+. def yyaccept throw :racc_jump, 2 end # Leave error recovering mode. def yyerrok @racc_error_status = 0 end # For debugging output def racc_read_token(t, tok, val) @racc_debug_out.print 'read ' @racc_debug_out.print tok.inspect, '(', racc_token2str(t), ') ' @racc_debug_out.puts val.inspect @racc_debug_out.puts end def racc_shift(tok, tstack, vstack) @racc_debug_out.puts "shift #{racc_token2str tok}" racc_print_stacks tstack, vstack @racc_debug_out.puts end def racc_reduce(toks, sim, tstack, vstack) out = @racc_debug_out out.print 'reduce ' if toks.empty? out.print ' ' else toks.each {|t| out.print ' ', racc_token2str(t) } end out.puts " --> #{racc_token2str(sim)}" racc_print_stacks tstack, vstack @racc_debug_out.puts end def racc_accept @racc_debug_out.puts 'accept' @racc_debug_out.puts end def racc_e_pop(state, tstack, vstack) @racc_debug_out.puts 'error recovering mode: pop token' racc_print_states state racc_print_stacks tstack, vstack @racc_debug_out.puts end def racc_next_state(curstate, state) @racc_debug_out.puts "goto #{curstate}" racc_print_states state @racc_debug_out.puts end def racc_print_stacks(t, v) out = @racc_debug_out out.print ' [' t.each_index do |i| out.print ' (', racc_token2str(t[i]), ' ', v[i].inspect, ')' end out.puts ' ]' end def racc_print_states(s) out = @racc_debug_out out.print ' [' s.each {|st| out.print ' ', st } out.puts ' ]' end def racc_token2str(tok) self.class::Racc_token_to_s_table[tok] or raise "[Racc Bug] can't convert token #{tok} to string" end # Convert internal ID of token symbol to the string. def token_to_str(t) self.class::Racc_token_to_s_table[t] end end end ...end racc/parser.rb/module_eval... end ###### racc/parser.rb end module Lrama class Parser < Racc::Parser module_eval(<<'...end parser.y/module_eval...', 'parser.y', 417) include Lrama::Report::Duration def initialize(text, path, debug = false) @grammar_file = Lrama::Lexer::GrammarFile.new(path, text) @yydebug = debug @rule_counter = Lrama::Grammar::Counter.new(0) @midrule_action_counter = Lrama::Grammar::Counter.new(1) end def parse report_duration(:parse) do @lexer = Lrama::Lexer.new(@grammar_file) @grammar = Lrama::Grammar.new(@rule_counter) @precedence_number = 0 reset_precs do_parse @grammar end end def next_token @lexer.next_token end def on_error(error_token_id, error_value, value_stack) if error_value.is_a?(Lrama::Lexer::Token) location = error_value.location value = "'#{error_value.s_value}'" else location = @lexer.location value = error_value.inspect end error_message = "parse error on value #{value} (#{token_to_str(error_token_id) || '?'})" raise_parse_error(error_message, location) end def on_action_error(error_message, error_value) if error_value.is_a?(Lrama::Lexer::Token) location = error_value.location else location = @lexer.location end raise_parse_error(error_message, location) end private def reset_precs @prec_seen = false @code_after_prec = false end def begin_c_declaration(end_symbol) @lexer.status = :c_declaration @lexer.end_symbol = end_symbol end def end_c_declaration @lexer.status = :initial @lexer.end_symbol = nil end def raise_parse_error(error_message, location) raise ParseError, location.generate_error_message(error_message) end ...end parser.y/module_eval... ##### State transition tables begin ### racc_action_table = [ 94, 48, 95, 166, 48, 77, 172, 48, 77, 166, 48, 77, 172, 48, 77, 47, 6, 85, 69, 48, 48, 47, 47, 77, 74, 81, 48, 48, 47, 47, 40, 81, 81, 48, 41, 47, 92, 48, 81, 47, 44, 77, 103, 168, 169, 45, 175, 169, 96, 168, 169, 52, 175, 169, 86, 20, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 92, 48, 4, 47, 5, 77, 103, 48, 48, 47, 47, 77, 103, 116, 48, 4, 47, 5, 77, 20, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 11, 12, 13, 14, 15, 16, 17, 18, 19, 52, 20, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 11, 12, 13, 14, 15, 16, 17, 18, 19, 43, 20, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 48, 48, 47, 47, 77, 103, 48, 48, 47, 47, 77, 77, 48, 48, 47, 47, 77, 77, 48, 48, 196, 196, 77, 77, 48, 48, 47, 196, 77, 77, 148, 170, 52, 149, 149, 180, 181, 182, 131, 180, 181, 182, 131, 203, 208, 215, 204, 204, 204, 48, 48, 47, 47, 48, 48, 47, 47, 48, 48, 47, 47, 180, 181, 182, 119, 120, 55, 52, 52, 52, 52, 52, 61, 62, 63, 64, 65, 87, 52, 52, 106, 109, 111, 118, 125, 126, 128, 131, 132, 77, 140, 141, 142, 143, 145, 146, 153, 140, 155, 153, 159, 160, 161, 163, 164, 171, 176, 153, 183, 131, 187, 153, 189, 131, 153, 198, 153, 131, 161, 164, 205, 164, 161, 161, 213, 131, 161 ] racc_action_check = [ 46, 151, 46, 151, 157, 151, 157, 177, 157, 177, 188, 177, 188, 32, 188, 32, 1, 38, 32, 33, 34, 33, 34, 33, 33, 34, 35, 36, 35, 36, 5, 35, 36, 37, 6, 37, 44, 58, 37, 58, 9, 58, 58, 151, 151, 11, 157, 157, 46, 177, 177, 13, 188, 188, 38, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 88, 59, 0, 59, 0, 59, 59, 60, 79, 60, 79, 60, 60, 79, 72, 2, 72, 2, 72, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 3, 3, 3, 3, 3, 3, 3, 3, 3, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 100, 12, 100, 12, 100, 100, 74, 111, 74, 111, 74, 111, 168, 175, 168, 175, 168, 175, 183, 189, 183, 189, 183, 189, 204, 205, 204, 205, 204, 205, 139, 154, 15, 139, 154, 165, 165, 165, 165, 173, 173, 173, 173, 195, 200, 212, 195, 200, 212, 67, 69, 67, 69, 81, 106, 81, 106, 114, 116, 114, 116, 197, 197, 197, 86, 86, 16, 17, 20, 24, 25, 26, 27, 28, 29, 30, 31, 39, 50, 55, 66, 70, 71, 85, 89, 90, 91, 92, 98, 110, 118, 119, 120, 121, 130, 131, 141, 142, 144, 145, 146, 147, 148, 149, 150, 156, 162, 164, 166, 167, 170, 171, 172, 174, 176, 186, 187, 191, 192, 194, 196, 199, 201, 203, 207, 208, 214 ] racc_action_pointer = [ 63, 16, 76, 93, nil, 23, 34, nil, 119, 31, nil, 39, 156, 5, 69, 144, 219, 179, nil, nil, 180, nil, nil, nil, 181, 182, 183, 225, 226, 227, 228, 229, 10, 16, 17, 23, 24, 30, 12, 233, nil, nil, nil, nil, 32, nil, -5, nil, nil, nil, 190, nil, nil, nil, nil, 191, nil, nil, 34, 69, 75, nil, nil, nil, nil, nil, 230, 204, nil, 205, 233, 232, 82, nil, 161, nil, nil, nil, nil, 76, nil, 208, nil, nil, nil, 202, 218, nil, 67, 233, 221, 222, 194, nil, nil, nil, nil, nil, 244, nil, 155, nil, nil, nil, nil, nil, 209, nil, nil, nil, 240, 162, nil, nil, 212, nil, 213, nil, 243, 208, 211, 240, nil, nil, nil, nil, nil, nil, nil, nil, 211, 248, nil, nil, nil, nil, nil, nil, nil, 148, nil, 200, 250, nil, 254, 203, 206, 212, 252, 256, 218, -2, nil, nil, 149, nil, 219, 1, nil, nil, nil, nil, 223, nil, 211, 145, 227, 216, 167, nil, 227, 215, 231, 149, 220, 168, 218, 4, nil, nil, nil, nil, nil, 173, nil, nil, 271, 220, 7, 174, nil, 224, 268, nil, 233, 161, 239, 171, nil, 235, 162, 272, nil, 273, 179, 180, nil, 235, 232, nil, nil, nil, 163, nil, 276, nil, nil ] racc_action_default = [ -1, -127, -1, -3, -10, -127, -127, -2, -3, -127, -16, -127, -127, -127, -127, -127, -127, -127, -24, -25, -127, -30, -31, -32, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -13, 217, -4, -26, -127, -17, -118, -89, -90, -117, -14, -19, -81, -20, -21, -127, -23, -29, -127, -127, -127, -36, -37, -38, -39, -40, -41, -47, -49, -127, -52, -42, -74, -76, -127, -79, -80, -126, -43, -84, -86, -127, -44, -45, -46, -127, -127, -11, -5, -7, -91, -127, -64, -18, -119, -120, -121, -15, -127, -22, -27, -33, -122, -123, -34, -35, -127, -48, -50, -53, -72, -127, -75, -77, -84, -85, -127, -87, -127, -127, -127, -127, -6, -8, -9, -115, -92, -93, -94, -65, -127, -127, -82, -28, -51, -54, -73, -78, -88, -127, -60, -124, -127, -12, -127, -124, -127, -127, -55, -127, -58, -62, -66, -125, -127, -116, -95, -96, -98, -114, -83, -56, -127, -61, -124, -64, -89, -64, -127, -111, -127, -124, -89, -64, -64, -127, -124, -63, -67, -68, -104, -105, -106, -127, -70, -71, -127, -124, -97, -127, -99, -64, -55, -103, -57, -127, -89, -107, -112, -59, -127, -55, -102, -55, -127, -127, -109, -127, -64, -100, -69, -108, -127, -113, -55, -110, -101 ] racc_goto_table = [ 102, 102, 102, 49, 130, 73, 68, 89, 162, 91, 150, 139, 101, 104, 105, 1, 9, 174, 51, 53, 54, 42, 115, 70, 117, 79, 79, 79, 79, 56, 123, 3, 57, 7, 124, 154, 58, 59, 60, 179, 158, 107, 102, 108, 112, 194, 113, 191, 174, 157, 39, 122, 202, 91, 133, 97, 199, 115, 70, 138, 70, 209, 195, 210, 121, 46, 158, 99, 200, 93, 114, 206, 114, 66, 216, 188, 71, 178, 135, 184, 134, 110, 177, 137, 212, 190, 192, 78, 82, 83, 84, 136, 98, 165, 147, 127, 156, 70, 186, 173, 207, 144, nil, 201, nil, 114, nil, 114, nil, nil, 185, nil, nil, nil, nil, nil, nil, 193, nil, 165, 214, nil, nil, nil, nil, 197, nil, nil, nil, nil, 173, 197, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, 211, 197 ] racc_goto_check = [ 35, 35, 35, 27, 40, 42, 26, 8, 32, 12, 31, 30, 21, 21, 21, 1, 7, 39, 16, 16, 16, 7, 45, 27, 45, 27, 27, 27, 27, 15, 5, 6, 15, 6, 9, 30, 15, 15, 15, 37, 34, 26, 35, 26, 42, 31, 42, 37, 39, 49, 10, 8, 32, 12, 21, 16, 31, 45, 27, 45, 27, 32, 38, 32, 11, 13, 34, 15, 38, 14, 27, 37, 27, 22, 32, 49, 23, 40, 28, 40, 26, 29, 33, 42, 38, 40, 40, 24, 24, 24, 24, 41, 43, 35, 44, 47, 48, 27, 50, 35, 51, 52, nil, 40, nil, 27, nil, 27, nil, nil, 35, nil, nil, nil, nil, nil, nil, 35, nil, 35, 40, nil, nil, nil, nil, 35, nil, nil, nil, nil, 35, 35, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, 35, 35 ] racc_goto_pointer = [ nil, 15, nil, nil, nil, -59, 31, 13, -37, -55, 46, -23, -35, 53, 23, 12, 5, nil, nil, nil, nil, -46, 41, 43, 53, nil, -26, -9, -32, 11, -107, -131, -140, -82, -105, -58, nil, -126, -121, -140, -88, -19, -28, 40, -38, -57, nil, 5, -49, -96, -71, -98, -24 ] racc_goto_default = [ nil, nil, 2, 8, 88, nil, nil, nil, nil, nil, nil, nil, 10, nil, nil, 50, nil, 21, 22, 23, 100, nil, nil, nil, nil, 67, nil, 75, nil, nil, nil, nil, nil, 151, 152, 72, 129, nil, nil, 167, nil, 76, nil, nil, nil, 80, 90, nil, nil, nil, nil, nil, nil ] racc_reduce_table = [ 0, 0, :racc_error, 0, 61, :_reduce_1, 2, 61, :_reduce_2, 0, 62, :_reduce_3, 2, 62, :_reduce_4, 1, 63, :_reduce_5, 2, 63, :_reduce_6, 0, 64, :_reduce_none, 1, 64, :_reduce_none, 5, 56, :_reduce_none, 0, 65, :_reduce_10, 0, 66, :_reduce_11, 5, 57, :_reduce_12, 2, 57, :_reduce_none, 1, 71, :_reduce_14, 2, 71, :_reduce_15, 1, 58, :_reduce_none, 2, 58, :_reduce_17, 3, 58, :_reduce_none, 2, 58, :_reduce_none, 2, 58, :_reduce_20, 2, 58, :_reduce_21, 3, 58, :_reduce_22, 2, 58, :_reduce_23, 1, 58, :_reduce_24, 1, 58, :_reduce_25, 2, 58, :_reduce_none, 1, 76, :_reduce_27, 2, 76, :_reduce_28, 2, 67, :_reduce_29, 1, 67, :_reduce_none, 1, 67, :_reduce_none, 1, 67, :_reduce_none, 3, 67, :_reduce_33, 3, 67, :_reduce_34, 3, 67, :_reduce_35, 2, 67, :_reduce_36, 2, 67, :_reduce_37, 2, 67, :_reduce_38, 2, 67, :_reduce_39, 2, 67, :_reduce_40, 2, 72, :_reduce_none, 2, 72, :_reduce_42, 2, 72, :_reduce_43, 2, 72, :_reduce_44, 2, 72, :_reduce_45, 2, 72, :_reduce_46, 1, 81, :_reduce_47, 2, 81, :_reduce_48, 1, 77, :_reduce_49, 2, 77, :_reduce_50, 3, 77, :_reduce_51, 0, 84, :_reduce_none, 1, 84, :_reduce_none, 3, 80, :_reduce_54, 0, 87, :_reduce_none, 1, 87, :_reduce_none, 8, 73, :_reduce_57, 5, 74, :_reduce_58, 8, 74, :_reduce_59, 1, 85, :_reduce_60, 3, 85, :_reduce_61, 1, 86, :_reduce_62, 3, 86, :_reduce_63, 0, 95, :_reduce_none, 1, 95, :_reduce_none, 1, 88, :_reduce_66, 3, 88, :_reduce_67, 3, 88, :_reduce_68, 6, 88, :_reduce_69, 3, 88, :_reduce_70, 3, 88, :_reduce_71, 0, 83, :_reduce_none, 1, 83, :_reduce_73, 1, 97, :_reduce_74, 2, 97, :_reduce_75, 1, 78, :_reduce_76, 2, 78, :_reduce_77, 3, 78, :_reduce_78, 1, 90, :_reduce_none, 1, 90, :_reduce_none, 0, 98, :_reduce_81, 0, 99, :_reduce_82, 5, 70, :_reduce_83, 1, 100, :_reduce_84, 2, 100, :_reduce_85, 1, 79, :_reduce_86, 2, 79, :_reduce_87, 3, 79, :_reduce_88, 1, 82, :_reduce_89, 1, 82, :_reduce_90, 0, 102, :_reduce_none, 1, 102, :_reduce_none, 2, 59, :_reduce_none, 2, 59, :_reduce_none, 4, 101, :_reduce_95, 1, 103, :_reduce_96, 3, 103, :_reduce_97, 1, 104, :_reduce_98, 3, 104, :_reduce_99, 5, 104, :_reduce_100, 7, 104, :_reduce_101, 4, 104, :_reduce_102, 3, 104, :_reduce_103, 1, 92, :_reduce_104, 1, 92, :_reduce_105, 1, 92, :_reduce_106, 1, 93, :_reduce_107, 3, 93, :_reduce_108, 2, 93, :_reduce_109, 4, 93, :_reduce_110, 0, 105, :_reduce_111, 0, 106, :_reduce_112, 5, 94, :_reduce_113, 3, 91, :_reduce_114, 0, 107, :_reduce_115, 3, 60, :_reduce_116, 1, 68, :_reduce_none, 0, 69, :_reduce_none, 1, 69, :_reduce_none, 1, 69, :_reduce_none, 1, 69, :_reduce_none, 1, 75, :_reduce_none, 1, 75, :_reduce_none, 0, 89, :_reduce_none, 1, 89, :_reduce_none, 1, 96, :_reduce_126 ] racc_reduce_n = 127 racc_shift_n = 217 racc_token_table = { false => 0, :error => 1, :C_DECLARATION => 2, :CHARACTER => 3, :IDENT_COLON => 4, :IDENTIFIER => 5, :INTEGER => 6, :STRING => 7, :TAG => 8, "%%" => 9, "%{" => 10, "%}" => 11, "%require" => 12, "%expect" => 13, "%define" => 14, "%param" => 15, "%lex-param" => 16, "%parse-param" => 17, "%code" => 18, "%initial-action" => 19, "%no-stdlib" => 20, "%locations" => 21, ";" => 22, "%union" => 23, "%destructor" => 24, "%printer" => 25, "%error-token" => 26, "%after-shift" => 27, "%before-reduce" => 28, "%after-reduce" => 29, "%after-shift-error-token" => 30, "%after-pop-stack" => 31, "%token" => 32, "%type" => 33, "%left" => 34, "%right" => 35, "%precedence" => 36, "%nonassoc" => 37, "%rule" => 38, "(" => 39, ")" => 40, ":" => 41, "%inline" => 42, "," => 43, "|" => 44, "%prec" => 45, "{" => 46, "}" => 47, "?" => 48, "+" => 49, "*" => 50, "[" => 51, "]" => 52, "{...}" => 53, "%empty" => 54 } racc_nt_base = 55 racc_use_result_var = true Racc_arg = [ racc_action_table, racc_action_check, racc_action_default, racc_action_pointer, racc_goto_table, racc_goto_check, racc_goto_default, racc_goto_pointer, racc_nt_base, racc_reduce_table, racc_token_table, racc_shift_n, racc_reduce_n, racc_use_result_var ] Ractor.make_shareable(Racc_arg) if defined?(Ractor) Racc_token_to_s_table = [ "$end", "error", "C_DECLARATION", "CHARACTER", "IDENT_COLON", "IDENTIFIER", "INTEGER", "STRING", "TAG", "\"%%\"", "\"%{\"", "\"%}\"", "\"%require\"", "\"%expect\"", "\"%define\"", "\"%param\"", "\"%lex-param\"", "\"%parse-param\"", "\"%code\"", "\"%initial-action\"", "\"%no-stdlib\"", "\"%locations\"", "\";\"", "\"%union\"", "\"%destructor\"", "\"%printer\"", "\"%error-token\"", "\"%after-shift\"", "\"%before-reduce\"", "\"%after-reduce\"", "\"%after-shift-error-token\"", "\"%after-pop-stack\"", "\"%token\"", "\"%type\"", "\"%left\"", "\"%right\"", "\"%precedence\"", "\"%nonassoc\"", "\"%rule\"", "\"(\"", "\")\"", "\":\"", "\"%inline\"", "\",\"", "\"|\"", "\"%prec\"", "\"{\"", "\"}\"", "\"?\"", "\"+\"", "\"*\"", "\"[\"", "\"]\"", "\"{...}\"", "\"%empty\"", "$start", "input", "prologue_declaration", "bison_declaration", "rules_or_grammar_declaration", "epilogue_declaration", "\"-many@prologue_declaration\"", "\"-many@bison_declaration\"", "\"-many1@rules_or_grammar_declaration\"", "\"-option@epilogue_declaration\"", "@1", "@2", "grammar_declaration", "variable", "value", "param", "\"-many1@param\"", "symbol_declaration", "rule_declaration", "inline_declaration", "generic_symbol", "\"-many1@generic_symbol\"", "token_declarations", "symbol_declarations", "token_declarations_for_precedence", "token_declaration", "\"-many1@token_declaration\"", "id", "alias", "\"-option@INTEGER\"", "rule_args", "rule_rhs_list", "\"-option@TAG\"", "rule_rhs", "empty", "symbol", "named_ref", "parameterizing_suffix", "parameterizing_args", "midrule_action", "\"-option@named_ref\"", "string_as_id", "\"-many1@symbol\"", "@3", "@4", "\"-many1@id\"", "rules", "\"-option@;\"", "rhs_list", "rhs", "@5", "@6", "@7" ] Ractor.make_shareable(Racc_token_to_s_table) if defined?(Ractor) Racc_debug_parser = true ##### State transition tables end ##### # reduce 0 omitted module_eval(<<'.,.,', 'parser.y', 11) def _reduce_1(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 11) def _reduce_2(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 11) def _reduce_3(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 11) def _reduce_4(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 11) def _reduce_5(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 11) def _reduce_6(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., # reduce 7 omitted # reduce 8 omitted # reduce 9 omitted module_eval(<<'.,.,', 'parser.y', 12) def _reduce_10(val, _values, result) begin_c_declaration("%}") @grammar.prologue_first_lineno = @lexer.line result end .,., module_eval(<<'.,.,', 'parser.y', 17) def _reduce_11(val, _values, result) end_c_declaration result end .,., module_eval(<<'.,.,', 'parser.y', 21) def _reduce_12(val, _values, result) @grammar.prologue = val[2].s_value result end .,., # reduce 13 omitted module_eval(<<'.,.,', 'parser.y', 54) def _reduce_14(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 54) def _reduce_15(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., # reduce 16 omitted module_eval(<<'.,.,', 'parser.y', 26) def _reduce_17(val, _values, result) @grammar.expect = val[1] result end .,., # reduce 18 omitted # reduce 19 omitted module_eval(<<'.,.,', 'parser.y', 31) def _reduce_20(val, _values, result) val[1].each {|token| @grammar.lex_param = Grammar::Code::NoReferenceCode.new(type: :lex_param, token_code: token).token_code.s_value } result end .,., module_eval(<<'.,.,', 'parser.y', 37) def _reduce_21(val, _values, result) val[1].each {|token| @grammar.parse_param = Grammar::Code::NoReferenceCode.new(type: :parse_param, token_code: token).token_code.s_value } result end .,., module_eval(<<'.,.,', 'parser.y', 43) def _reduce_22(val, _values, result) @grammar.add_percent_code(id: val[1], code: val[2]) result end .,., module_eval(<<'.,.,', 'parser.y', 47) def _reduce_23(val, _values, result) @grammar.initial_action = Grammar::Code::InitialActionCode.new(type: :initial_action, token_code: val[1]) result end .,., module_eval(<<'.,.,', 'parser.y', 49) def _reduce_24(val, _values, result) @grammar.no_stdlib = true result end .,., module_eval(<<'.,.,', 'parser.y', 50) def _reduce_25(val, _values, result) @grammar.locations = true result end .,., # reduce 26 omitted module_eval(<<'.,.,', 'parser.y', 109) def _reduce_27(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 109) def _reduce_28(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 55) def _reduce_29(val, _values, result) @grammar.set_union( Grammar::Code::NoReferenceCode.new(type: :union, token_code: val[1]), val[1].line ) result end .,., # reduce 30 omitted # reduce 31 omitted # reduce 32 omitted module_eval(<<'.,.,', 'parser.y', 65) def _reduce_33(val, _values, result) @grammar.add_destructor( ident_or_tags: val[2], token_code: val[1], lineno: val[1].line ) result end .,., module_eval(<<'.,.,', 'parser.y', 73) def _reduce_34(val, _values, result) @grammar.add_printer( ident_or_tags: val[2], token_code: val[1], lineno: val[1].line ) result end .,., module_eval(<<'.,.,', 'parser.y', 81) def _reduce_35(val, _values, result) @grammar.add_error_token( ident_or_tags: val[2], token_code: val[1], lineno: val[1].line ) result end .,., module_eval(<<'.,.,', 'parser.y', 89) def _reduce_36(val, _values, result) @grammar.after_shift = val[1] result end .,., module_eval(<<'.,.,', 'parser.y', 93) def _reduce_37(val, _values, result) @grammar.before_reduce = val[1] result end .,., module_eval(<<'.,.,', 'parser.y', 97) def _reduce_38(val, _values, result) @grammar.after_reduce = val[1] result end .,., module_eval(<<'.,.,', 'parser.y', 101) def _reduce_39(val, _values, result) @grammar.after_shift_error_token = val[1] result end .,., module_eval(<<'.,.,', 'parser.y', 105) def _reduce_40(val, _values, result) @grammar.after_pop_stack = val[1] result end .,., # reduce 41 omitted module_eval(<<'.,.,', 'parser.y', 111) def _reduce_42(val, _values, result) val[1].each {|hash| hash[:tokens].each {|id| @grammar.add_type(id: id, tag: hash[:tag]) } } result end .,., module_eval(<<'.,.,', 'parser.y', 119) def _reduce_43(val, _values, result) val[1].each {|hash| hash[:tokens].each {|id| sym = @grammar.add_term(id: id) @grammar.add_left(sym, @precedence_number) } } @precedence_number += 1 result end .,., module_eval(<<'.,.,', 'parser.y', 129) def _reduce_44(val, _values, result) val[1].each {|hash| hash[:tokens].each {|id| sym = @grammar.add_term(id: id) @grammar.add_right(sym, @precedence_number) } } @precedence_number += 1 result end .,., module_eval(<<'.,.,', 'parser.y', 139) def _reduce_45(val, _values, result) val[1].each {|hash| hash[:tokens].each {|id| sym = @grammar.add_term(id: id) @grammar.add_precedence(sym, @precedence_number) } } @precedence_number += 1 result end .,., module_eval(<<'.,.,', 'parser.y', 149) def _reduce_46(val, _values, result) val[1].each {|hash| hash[:tokens].each {|id| sym = @grammar.add_term(id: id) @grammar.add_nonassoc(sym, @precedence_number) } } @precedence_number += 1 result end .,., module_eval(<<'.,.,', 'parser.y', 178) def _reduce_47(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 178) def _reduce_48(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 160) def _reduce_49(val, _values, result) val[0].each {|token_declaration| @grammar.add_term(id: token_declaration[0], alias_name: token_declaration[2], token_id: token_declaration[1], tag: nil, replace: true) } result end .,., module_eval(<<'.,.,', 'parser.y', 166) def _reduce_50(val, _values, result) val[1].each {|token_declaration| @grammar.add_term(id: token_declaration[0], alias_name: token_declaration[2], token_id: token_declaration[1], tag: val[0], replace: true) } result end .,., module_eval(<<'.,.,', 'parser.y', 172) def _reduce_51(val, _values, result) val[2].each {|token_declaration| @grammar.add_term(id: token_declaration[0], alias_name: token_declaration[2], token_id: token_declaration[1], tag: val[1], replace: true) } result end .,., # reduce 52 omitted # reduce 53 omitted module_eval(<<'.,.,', 'parser.y', 177) def _reduce_54(val, _values, result) result = val result end .,., # reduce 55 omitted # reduce 56 omitted module_eval(<<'.,.,', 'parser.y', 181) def _reduce_57(val, _values, result) rule = Grammar::ParameterizingRule::Rule.new(val[1].s_value, val[3], val[7], tag: val[5]) @grammar.add_parameterizing_rule(rule) result end .,., module_eval(<<'.,.,', 'parser.y', 187) def _reduce_58(val, _values, result) rule = Grammar::ParameterizingRule::Rule.new(val[2].s_value, [], val[4], is_inline: true) @grammar.add_parameterizing_rule(rule) result end .,., module_eval(<<'.,.,', 'parser.y', 192) def _reduce_59(val, _values, result) rule = Grammar::ParameterizingRule::Rule.new(val[2].s_value, val[4], val[7], is_inline: true) @grammar.add_parameterizing_rule(rule) result end .,., module_eval(<<'.,.,', 'parser.y', 196) def _reduce_60(val, _values, result) result = [val[0]] result end .,., module_eval(<<'.,.,', 'parser.y', 197) def _reduce_61(val, _values, result) result = val[0].append(val[2]) result end .,., module_eval(<<'.,.,', 'parser.y', 201) def _reduce_62(val, _values, result) builder = val[0] result = [builder] result end .,., module_eval(<<'.,.,', 'parser.y', 206) def _reduce_63(val, _values, result) builder = val[2] result = val[0].append(builder) result end .,., # reduce 64 omitted # reduce 65 omitted module_eval(<<'.,.,', 'parser.y', 212) def _reduce_66(val, _values, result) reset_precs result = Grammar::ParameterizingRule::Rhs.new result end .,., module_eval(<<'.,.,', 'parser.y', 217) def _reduce_67(val, _values, result) token = val[1] token.alias_name = val[2] builder = val[0] builder.symbols << token result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 225) def _reduce_68(val, _values, result) builder = val[0] builder.symbols << Lrama::Lexer::Token::InstantiateRule.new(s_value: val[2], location: @lexer.location, args: [val[1]]) result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 231) def _reduce_69(val, _values, result) builder = val[0] builder.symbols << Lrama::Lexer::Token::InstantiateRule.new(s_value: val[1].s_value, location: @lexer.location, args: val[3], lhs_tag: val[5]) result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 237) def _reduce_70(val, _values, result) user_code = val[1] user_code.alias_name = val[2] builder = val[0] builder.user_code = user_code result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 245) def _reduce_71(val, _values, result) sym = @grammar.find_symbol_by_id!(val[2]) @prec_seen = true builder = val[0] builder.precedence_sym = sym result = builder result end .,., # reduce 72 omitted module_eval(<<'.,.,', 'parser.y', 253) def _reduce_73(val, _values, result) result = val[0].s_value result end .,., module_eval(<<'.,.,', 'parser.y', 260) def _reduce_74(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 260) def _reduce_75(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 255) def _reduce_76(val, _values, result) result = [{tag: nil, tokens: val[0]}] result end .,., module_eval(<<'.,.,', 'parser.y', 256) def _reduce_77(val, _values, result) result = [{tag: val[0], tokens: val[1]}] result end .,., module_eval(<<'.,.,', 'parser.y', 257) def _reduce_78(val, _values, result) result = val[0].append({tag: val[1], tokens: val[2]}) result end .,., # reduce 79 omitted # reduce 80 omitted module_eval(<<'.,.,', 'parser.y', 263) def _reduce_81(val, _values, result) begin_c_declaration("}") result end .,., module_eval(<<'.,.,', 'parser.y', 267) def _reduce_82(val, _values, result) end_c_declaration result end .,., module_eval(<<'.,.,', 'parser.y', 271) def _reduce_83(val, _values, result) result = val[2] result end .,., module_eval(<<'.,.,', 'parser.y', 279) def _reduce_84(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 279) def _reduce_85(val, _values, result) result = val[1] ? val[1].unshift(val[0]) : val result end .,., module_eval(<<'.,.,', 'parser.y', 274) def _reduce_86(val, _values, result) result = [{tag: nil, tokens: val[0]}] result end .,., module_eval(<<'.,.,', 'parser.y', 275) def _reduce_87(val, _values, result) result = [{tag: val[0], tokens: val[1]}] result end .,., module_eval(<<'.,.,', 'parser.y', 276) def _reduce_88(val, _values, result) result = val[0].append({tag: val[1], tokens: val[2]}) result end .,., module_eval(<<'.,.,', 'parser.y', 278) def _reduce_89(val, _values, result) on_action_error("ident after %prec", val[0]) if @prec_seen result end .,., module_eval(<<'.,.,', 'parser.y', 279) def _reduce_90(val, _values, result) on_action_error("char after %prec", val[0]) if @prec_seen result end .,., # reduce 91 omitted # reduce 92 omitted # reduce 93 omitted # reduce 94 omitted module_eval(<<'.,.,', 'parser.y', 287) def _reduce_95(val, _values, result) lhs = val[0] lhs.alias_name = val[1] val[3].each do |builder| builder.lhs = lhs builder.complete_input @grammar.add_rule_builder(builder) end result end .,., module_eval(<<'.,.,', 'parser.y', 298) def _reduce_96(val, _values, result) builder = val[0] if !builder.line builder.line = @lexer.line - 1 end result = [builder] result end .,., module_eval(<<'.,.,', 'parser.y', 306) def _reduce_97(val, _values, result) builder = val[2] if !builder.line builder.line = @lexer.line - 1 end result = val[0].append(builder) result end .,., module_eval(<<'.,.,', 'parser.y', 315) def _reduce_98(val, _values, result) reset_precs result = @grammar.create_rule_builder(@rule_counter, @midrule_action_counter) result end .,., module_eval(<<'.,.,', 'parser.y', 320) def _reduce_99(val, _values, result) token = val[1] token.alias_name = val[2] builder = val[0] builder.add_rhs(token) result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 328) def _reduce_100(val, _values, result) token = Lrama::Lexer::Token::InstantiateRule.new(s_value: val[2], alias_name: val[3], location: @lexer.location, args: [val[1]], lhs_tag: val[4]) builder = val[0] builder.add_rhs(token) builder.line = val[1].first_line result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 336) def _reduce_101(val, _values, result) token = Lrama::Lexer::Token::InstantiateRule.new(s_value: val[1].s_value, alias_name: val[5], location: @lexer.location, args: val[3], lhs_tag: val[6]) builder = val[0] builder.add_rhs(token) builder.line = val[1].first_line result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 344) def _reduce_102(val, _values, result) user_code = val[1] user_code.alias_name = val[2] user_code.tag = val[3] builder = val[0] builder.user_code = user_code result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 353) def _reduce_103(val, _values, result) sym = @grammar.find_symbol_by_id!(val[2]) @prec_seen = true builder = val[0] builder.precedence_sym = sym result = builder result end .,., module_eval(<<'.,.,', 'parser.y', 360) def _reduce_104(val, _values, result) result = "option" result end .,., module_eval(<<'.,.,', 'parser.y', 361) def _reduce_105(val, _values, result) result = "nonempty_list" result end .,., module_eval(<<'.,.,', 'parser.y', 362) def _reduce_106(val, _values, result) result = "list" result end .,., module_eval(<<'.,.,', 'parser.y', 364) def _reduce_107(val, _values, result) result = [val[0]] result end .,., module_eval(<<'.,.,', 'parser.y', 365) def _reduce_108(val, _values, result) result = val[0].append(val[2]) result end .,., module_eval(<<'.,.,', 'parser.y', 366) def _reduce_109(val, _values, result) result = [Lrama::Lexer::Token::InstantiateRule.new(s_value: val[1].s_value, location: @lexer.location, args: val[0])] result end .,., module_eval(<<'.,.,', 'parser.y', 367) def _reduce_110(val, _values, result) result = [Lrama::Lexer::Token::InstantiateRule.new(s_value: val[0].s_value, location: @lexer.location, args: val[2])] result end .,., module_eval(<<'.,.,', 'parser.y', 371) def _reduce_111(val, _values, result) if @prec_seen on_action_error("multiple User_code after %prec", val[0]) if @code_after_prec @code_after_prec = true end begin_c_declaration("}") result end .,., module_eval(<<'.,.,', 'parser.y', 379) def _reduce_112(val, _values, result) end_c_declaration result end .,., module_eval(<<'.,.,', 'parser.y', 383) def _reduce_113(val, _values, result) result = val[2] result end .,., module_eval(<<'.,.,', 'parser.y', 386) def _reduce_114(val, _values, result) result = val[1].s_value result end .,., module_eval(<<'.,.,', 'parser.y', 390) def _reduce_115(val, _values, result) begin_c_declaration('\Z') @grammar.epilogue_first_lineno = @lexer.line + 1 result end .,., module_eval(<<'.,.,', 'parser.y', 395) def _reduce_116(val, _values, result) end_c_declaration @grammar.epilogue = val[2].s_value result end .,., # reduce 117 omitted # reduce 118 omitted # reduce 119 omitted # reduce 120 omitted # reduce 121 omitted # reduce 122 omitted # reduce 123 omitted # reduce 124 omitted # reduce 125 omitted module_eval(<<'.,.,', 'parser.y', 412) def _reduce_126(val, _values, result) result = Lrama::Lexer::Token::Ident.new(s_value: val[0]) result end .,., def _reduce_none(val, _values, result) val[0] end end # class Parser end # module Lrama