racc 1.5.2-java → 1.6.0-java

data/lib/racc/pre-setup

@@ -1,13 +0,0 @@
-def generate_parser_text_rb(target)
-  return if File.exist?(srcfile(target))
-  $stderr.puts "generating #{target}..."
-  File.open(target, 'w') {|f|
-    f.puts "module Racc"
-    f.puts "  PARSER_TEXT = <<'__end_of_file__'"
-    f.puts File.read(srcfile('parser.rb'))
-    f.puts "__end_of_file__"
-    f.puts "end"
-  }
-end
-
-generate_parser_text_rb 'parser-text.rb'

data/sample/array.y

@@ -1,67 +0,0 @@
-#
-#
-# convert Array-like string into Ruby's Array.
-
-class ArrayParser
-
-rule
-
-array   : '[' contents ']'
-            {
-              result = val[1]
-            }
-        | '[' ']'
-            {
-              result = []
-            }
-
-contents: ITEM
-            {
-              result = val
-            }
-        | contents ',' ITEM
-            {
-              result.push val[2]
-            }
-
----- inner
-
-  def parse(str)
-    str = str.strip
-    @q = []
-    until str.empty?
-      case str
-      when /\A\s+/
-        str = $'
-      when /\A\w+/
-        @q.push [:ITEM, $&]
-        str = $'
-      else
-        c = str[0,1]
-        @q.push [c, c]
-        str = str[1..-1]
-      end
-    end
-    @q.push [false, '$']   # is optional from Racc 1.3.7
-    do_parse
-  end
-
-  def next_token
-    @q.shift
-  end
-
----- footer
-
-if $0 == __FILE__
-  src = <<EOS
-[
-  a, b, c,
-  d,
-  e ]
-EOS
-  puts 'parsing:'
-  print src
-  puts
-  puts 'result:'
-  p ArrayParser.new.parse(src)
-end

data/sample/array2.y

@@ -1,59 +0,0 @@
-#
-#
-# Converting Array-like string into Ruby's Array, version 2.
-# This grammer uses no_result_var.
-
-class ArrayParser2
-  options no_result_var
-rule
-  array   : '[' contents ']' { val[1] }
-          | '[' ']'          { [] }
-
-  contents: ITEM              { val }
-          | contents ',' ITEM { val[0].push val[2]; val[0] }
-end
-
----- inner
-
-  def parse(str)
-    @str = str
-    yyparse self, :scan
-  end
-
-  def scan
-    str = @str.strip
-    until str.empty?
-      case str
-      when /\A\s+/
-        str = $'
-      when /\A\w+/
-        yield :ITEM, $&
-        str = $'
-      else
-        c = str[0,1]
-        yield c, c
-        str = str[1..-1]
-      end
-    end
-    yield false, '$'   # is optional from Racc 1.3.7
-  end
-
-  def next_token
-    @q.shift
-  end
-
----- footer
-
-if $0 == __FILE__
-  src = <<EOS
-[
-  a, b, c,
-  d,
-  e ]
-EOS
-  puts 'parsing:'
-  print src
-  puts
-  puts 'result:'
-  p ArrayParser2.new.parse(src)
-end

data/sample/calc-ja.y

@@ -1,66 +0,0 @@
-#
-#
-# A simple calculator, version 2.
-# This file contains Japanese characters (encoding=EUC-JP).
-
-class Calculator2
-  prechigh
-    nonassoc UMINUS
-    left '*' '/'
-    left '+' '-'
-  preclow
-  options no_result_var
-rule
-  target  : exp
-          | /* none */ { 0 }
-
-  exp     : exp '+' exp { val[0] + val[2] }
-          | exp '-' exp { val[0] - val[2] }
-          | exp '*' exp { val[0] * val[2] }
-          | exp '/' exp { val[0] / val[2] }
-          | '(' exp ')' { val[1] }
-          | '-' NUMBER  =UMINUS { -(val[1]) }
-          | NUMBER
-end
-
----- header
-#
----- inner
-  
-  def evaluate(str)
-    @tokens = []
-    until str.empty?
-      case str
-      when /\A\s+/
-        ;
-      when /\A\d+/
-        @tokens.push [:NUMBER, $&.to_i]
-      when /\A.|\n/
-        s = $&
-        @tokens.push [s, s]
-      end
-      str = $'
-    end
-    @tokens.push [false, '$']
-    do_parse
-  end
-
-  def next_token
-    @tokens.shift
-  end
-
----- footer
-
-puts 'Ķ������� 2 �浡'
-puts 'Q �ǽ�λ���ޤ�'
-calc = Calculator2.new
-while true
-  print '>>> '; $stdout.flush
-  str = $stdin.gets.strip
-  break if /q/i =~ str
-  begin
-    p calc.evaluate(str)
-  rescue ParseError
-    puts 'parse error'
-  end
-end

data/sample/calc.y

@@ -1,65 +0,0 @@
-#
-#
-# Very simple calculater.
-
-class Calcp
-  prechigh
-    nonassoc UMINUS
-    left '*' '/'
-    left '+' '-'
-  preclow
-rule
-  target: exp
-        | /* none */ { result = 0 }
-
-  exp: exp '+' exp { result += val[2] }
-     | exp '-' exp { result -= val[2] }
-     | exp '*' exp { result *= val[2] }
-     | exp '/' exp { result /= val[2] }
-     | '(' exp ')' { result = val[1] }
-     | '-' NUMBER  =UMINUS { result = -val[1] }
-     | NUMBER
-end
-
----- header
-#
----- inner
-  
-  def parse(str)
-    @q = []
-    until str.empty?
-      case str
-      when /\A\s+/
-      when /\A\d+/
-        @q.push [:NUMBER, $&.to_i]
-      when /\A.|\n/o
-        s = $&
-        @q.push [s, s]
-      end
-      str = $'
-    end
-    @q.push [false, '$end']
-    do_parse
-  end
-
-  def next_token
-    @q.shift
-  end
-
----- footer
-
-parser = Calcp.new
-puts
-puts 'type "Q" to quit.'
-puts
-while true
-  puts
-  print '? '
-  str = gets.chop!
-  break if /q/i =~ str
-  begin
-    puts "= #{parser.parse(str)}"
-  rescue ParseError
-    puts $!
-  end
-end

data/sample/conflict.y

@@ -1,15 +0,0 @@
-#
-#
-# Example of conflicted grammer.
-# This grammer contains 1 Shift/Reduce conflict and 1 Reduce/Reduce conflict.
-
-class A
-rule
-  target : outer
-
-  outer  :
-         | outer inner
-
-  inner  :
-         | inner ITEM
-end

data/sample/hash.y

@@ -1,60 +0,0 @@
-#
-#
-# Converting Hash-like string into Ruby's Hash.
-
-class HashParser
-  options no_result_var
-rule
-  hash    : '{' contents '}'   { val[1] }
-          | '{' '}'            { Hash.new }
-           
-                  # Racc can handle string over 2 bytes.
-  contents: IDENT '=>' IDENT              { {val[0] => val[2]} }
-          | contents ',' IDENT '=>' IDENT { val[0][val[2]] = val[4]; val[0] }
-end
-
----- inner
-
-  def parse(str)
-    @str = str
-    yyparse self, :scan
-  end
-
-  private
-
-  def scan
-    str = @str
-    until str.empty?
-      case str
-      when /\A\s+/
-        str = $'
-      when /\A\w+/
-        yield :IDENT, $&
-        str = $'
-      when /\A=>/
-        yield '=>', '=>'
-        str = $'
-      else
-        c = str[0,1]
-        yield c, c
-        str = str[1..-1]
-      end
-    end
-    yield false, '$'   # is optional from Racc 1.3.7
-  end
-
----- footer
-
-if $0 == __FILE__
-  src = <<EOS
-{
-  name => MyName,
-  id => MyIdent
-}
-EOS
-  puts 'Parsing (String):'
-  print src
-  puts
-  puts 'Result (Ruby Object):'
-  p HashParser.new.parse(src)
-end

data/sample/lalr.y

@@ -1,17 +0,0 @@
-#
-#
-# This is LALR grammer, and not LL/SLR.
-
-class A
-rule
-  A : L '=' E
-
-  L : i
-    | R '^' i
-
-  E : E '+' R
-    | R
-    | '@' L
-
-  R : i
-end

data/sample/lists.y

@@ -1,57 +0,0 @@
-#
-#
-# Rules for verious lists.
-# This file is just an example, you cannot compile this file.
-
-class ExampleOnly
-rule
-
-# a list, which minimum number of items is 0
-list0 :
-          {
-            result = []
-          }
-      | list0 item
-          {
-            result.push val[1]
-          }
-
-# a list, which minimum number of items is 1
-list1 : item
-          {
-            result = val
-          }
-      | list1 item
-          {
-            result.push val[1]
-          }
-
-# a list, separated by comma
-clist : item
-          {
-            result = val
-          }
-      | clist ',' item
-          {
-            result.push val[2]
-          }
-
-# a hash. see also "hash.y".
-hash  : '{' hash_contents '}'
-          {
-            result = val[1]
-          }
-      | '{' '}'
-          {
-            result = {}
-          }
-
-hash_contents
-      : item "=>" item
-          {
-            result = { val[0] => val[2] }
-          }
-      | hash_contents ',' item "=>" item
-          {
-            result[val[2]] = val[4]
-          }

data/sample/syntax.y

@@ -1,46 +0,0 @@
-#
-#
-# Racc syntax checker.  This grammer file generates
-# invalid ruby program, you cannot run this parser.
-
-class P
-  token A B C
-
-  convert
-    A '5'
-  end
-
-  prechigh
-    left B
-  preclow
-
-  options omit_action_call
-
-  start target
-rule
-  target: A B C
-            {
-              print 'abc'
-            }
-        | B C A
-        | C B A
-            {
-              print 'cba'
-            }
-        | cont
-  
-  cont  : A c2 B c2 C
-
-  c2    : C C C C C
-end
-
----- inner
-
-    junk code  !!!!
-
-kjaljlajrlaolanbla  /// %%%  (*((( token rule
-akiurtlajluealjflaj    @@@@   end end end end __END__
-  laieu2o879urkq96ga(Q#*&%Q#
- #&lkji  END
-
-         q395q?///  liutjqlkr7

data/sample/yyerr.y

@@ -1,46 +0,0 @@
-#
-#
-# Test grammer file for error handling.
-
-class A
-rule
-
-target: a b c
-
-a :
-      {
-        yyerror
-        raise ArgumentError, "yyerror failed"
-      }
-  | error
-
-b :
-      {
-        yyerrok
-      }
-
-c :
-      {
-        yyaccept
-        raise "yyaccept failed"
-      }
-
-end
-
----- inner
-
-  def parse
-    do_parse
-  end
-
-  def next_token
-    [false, '$end']
-  end
-
-  def on_error(*args)
-    $stderr.puts "on_error called: args=#{args.inspect}"
-  end
-
----- footer
-
-A.new.parse

data/test/assets/cadenza.y

@@ -1,170 +0,0 @@
-# This grammar is released under an MIT license
-# Author: William Howard (http://github.com/whoward)
-# Source: https://github.com/whoward/cadenza/blob/master/src/cadenza.y
-
-class Cadenza::RaccParser
-
-/* expect this many shift/reduce conflicts */
-expect 37
-
-rule
-  target
-    : document
-    | /* none */ { result = nil }
-    ;
-
-  parameter_list
-    : logical_expression                     { result = [val[0]] }
-    | parameter_list ',' logical_expression  { result = val[0].push(val[2]) }
-    ;
-
-  /* this has a shift/reduce conflict but since Racc will shift in this case it is the correct behavior */
-  primary_expression
-    : IDENTIFIER                   { result = VariableNode.new(val[0].value) }
-    | IDENTIFIER parameter_list    { result = VariableNode.new(val[0].value, val[1]) }
-    | INTEGER                      { result = ConstantNode.new(val[0].value) }
-    | REAL                         { result = ConstantNode.new(val[0].value) }
-    | STRING                       { result = ConstantNode.new(val[0].value) }
-    | '(' filtered_expression ')'   { result = val[1] }
-    ;
-
-  multiplicative_expression
-    : primary_expression
-    | multiplicative_expression '*' primary_expression { result = OperationNode.new(val[0], "*", val[2]) }
-    | multiplicative_expression '/' primary_expression { result = OperationNode.new(val[0], "/", val[2]) }
-    ;
-
-  additive_expression
-    : multiplicative_expression
-    | additive_expression '+' multiplicative_expression { result = OperationNode.new(val[0], "+", val[2]) }
-    | additive_expression '-' multiplicative_expression { result = OperationNode.new(val[0], "-", val[2]) }
-    ;
-
-  boolean_expression
-    : additive_expression
-    | boolean_expression OP_EQ additive_expression { result = OperationNode.new(val[0], "==", val[2]) }
-    | boolean_expression OP_NEQ additive_expression { result = OperationNode.new(val[0], "!=", val[2]) }
-    | boolean_expression OP_LEQ additive_expression { result = OperationNode.new(val[0], "<=", val[2]) }
-    | boolean_expression OP_GEQ additive_expression { result = OperationNode.new(val[0], ">=", val[2]) }
-    | boolean_expression '>' additive_expression  { result = OperationNode.new(val[0], ">", val[2]) }
-    | boolean_expression '<' additive_expression  { result = OperationNode.new(val[0], "<", val[2]) }
-    ;
-
-  inverse_expression
-    : boolean_expression
-    | NOT boolean_expression { result = BooleanInverseNode.new(val[1]) }
-    ;
-
-  logical_expression
-    : inverse_expression
-    | logical_expression AND inverse_expression { result = OperationNode.new(val[0], "and", val[2]) }
-    | logical_expression OR inverse_expression { result = OperationNode.new(val[0], "or", val[2]) }
-    ;
-
-  filter
-    : IDENTIFIER                    { result = FilterNode.new(val[0].value) }
-    | IDENTIFIER ':' parameter_list { result = FilterNode.new(val[0].value, val[2]) }
-    ;
-
-  filter_list
-    : filter { result = [val[0]] }
-    | filter_list '|' filter { result = val[0].push(val[2]) }
-    ;
-
-  filtered_expression
-    : logical_expression
-    | logical_expression '|' filter_list { result = FilteredValueNode.new(val[0], val[2]) }
-    ;
-
-  inject_statement
-    : VAR_OPEN filtered_expression VAR_CLOSE { result = val[1] }
-    ;
-
-  if_tag
-    : STMT_OPEN IF logical_expression STMT_CLOSE { open_scope!; result = val[2] }
-    | STMT_OPEN UNLESS logical_expression STMT_CLOSE { open_scope!; result = BooleanInverseNode.new(val[2]) }
-    ;
-
-  else_tag
-    : STMT_OPEN ELSE STMT_CLOSE { result = close_scope!; open_scope! }
-    ;
-
-  end_if_tag
-    : STMT_OPEN ENDIF STMT_CLOSE { result = close_scope! }
-    | STMT_OPEN ENDUNLESS STMT_CLOSE { result = close_scope! }
-    ;
-
-  if_block
-    : if_tag end_if_tag { result = IfNode.new(val[0], val[1]) }
-    | if_tag document end_if_tag { result = IfNode.new(val[0], val[2]) }
-    | if_tag else_tag document end_if_tag { result = IfNode.new(val[0], val[1], val[3]) }
-    | if_tag document else_tag end_if_tag { result = IfNode.new(val[0], val[2], val[3]) }
-    | if_tag document else_tag document end_if_tag { result = IfNode.new(val[0], val[2], val[4]) }
-    ;
-
-  for_tag
-    : STMT_OPEN FOR IDENTIFIER IN filtered_expression STMT_CLOSE { open_scope!; result = [val[2].value, val[4]] }
-    ;
-
-  end_for_tag
-    : STMT_OPEN ENDFOR STMT_CLOSE { result = close_scope! }
-    ;
-
-  /* this has a shift/reduce conflict but since Racc will shift in this case it is the correct behavior */
-  for_block
-    : for_tag end_for_tag { result = ForNode.new(VariableNode.new(val[0].first), val[0].last, val[1]) }
-    | for_tag document end_for_tag { result = ForNode.new(VariableNode.new(val[0].first), val[0].last, val[2]) }
-    ;
-
-  block_tag
-    : STMT_OPEN BLOCK IDENTIFIER STMT_CLOSE { result = open_block_scope!(val[2].value) }
-    ;
-
-  end_block_tag
-    : STMT_OPEN ENDBLOCK STMT_CLOSE { result = close_block_scope! }
-    ;
-
-  /* this has a shift/reduce conflict but since Racc will shift in this case it is the correct behavior */
-  block_block
-    : block_tag end_block_tag { result = BlockNode.new(val[0], val[1]) }
-    | block_tag document end_block_tag { result = BlockNode.new(val[0], val[2]) }
-    ;
-
-  generic_block_tag
-    : STMT_OPEN IDENTIFIER STMT_CLOSE { open_scope!; result = [val[1].value, []] }
-    | STMT_OPEN IDENTIFIER parameter_list STMT_CLOSE { open_scope!; result = [val[1].value, val[2]] }
-    ;
-
-  end_generic_block_tag
-    : STMT_OPEN END STMT_CLOSE { result = close_scope! }
-    ;
-
-  generic_block
-    : generic_block_tag document end_generic_block_tag { result = GenericBlockNode.new(val[0].first, val[2], val[0].last) }
-    ;
-
-  extends_statement
-    : STMT_OPEN EXTENDS STRING STMT_CLOSE { result = val[2].value }
-    | STMT_OPEN EXTENDS IDENTIFIER STMT_CLOSE { result = VariableNode.new(val[2].value) }
-    ;
-
-  document_component
-    : TEXT_BLOCK { result = TextNode.new(val[0].value) }
-    | inject_statement
-    | if_block
-    | for_block
-    | generic_block
-    | block_block
-    ;
-
-  document
-    : document_component { push val[0] }
-    | document document_component { push val[1] }
-    | extends_statement  { document.extends = val[0] }
-    | document extends_statement { document.extends = val[1] }
-    ;
-
----- header ----
-# racc_parser.rb : generated by racc
-
----- inner ----