gd-racc 1.4.11

data/sample/array.y

@@ -0,0 +1,67 @@
+# $Id$
+#
+# 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

@@ -0,0 +1,59 @@
+# $Id$
+#
+# 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

@@ -0,0 +1,66 @@
+# $Id$
+#
+# 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
+# $Id$
+---- 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

@@ -0,0 +1,65 @@
+# $Id$
+#
+# 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
+# $Id$
+---- 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

@@ -0,0 +1,15 @@
+# $Id$
+#
+# 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

@@ -0,0 +1,60 @@
+# $Id$
+#
+# 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

@@ -0,0 +1,17 @@
+# $Id$
+#
+# 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

@@ -0,0 +1,57 @@
+# $Id$
+#
+# 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

@@ -0,0 +1,46 @@
+# $Id$
+#
+# 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