racc 1.4.16 → 1.6.0

data/fastcache/extconf.rb

@@ -1,2 +0,0 @@
-require 'mkmf'
-create_makefile 'corecache'

data/fastcache/fastcache.c

@@ -1,185 +0,0 @@
-/*
-    $Id$
-
-    Copyright (C) 2005 Minero Aoki
-
-    This program is free software.
-    You can distribute/modify this program under the terms of
-    the GNU LGPL, Lesser General Public Licese version 2.1.
-*/
-
-#include "ruby.h"
-
-static VALUE LALRcoreCache;
-
-struct item_holder {
-    unsigned long hashval;
-    VALUE core;
-    VALUE state;
-    struct item_holder *next;
-};
-
-struct lalr_state_cache {
-    struct item_holder **bin;
-    long size;
-    long num;
-};
-
-static void
-lalrc_free(struct lalr_state_cache *p)
-{
-    struct item_holder *tmp;
-    long i;
-
-    for (i = 0; i < p->size; i++) {
-        while (tmp = p->bin[i]) {
-            p->bin[i] = tmp->next;
-            free(tmp);
-        }
-    }
-    free(p->bin);
-    free(p);
-}
-
-#define INIT_BIN 256
-
-static VALUE
-lalrc_s_new(VALUE self)
-{
-    struct lalr_state_cache *cache;
-
-    cache = ALLOC_N(struct lalr_state_cache, 1);
-    cache->bin = ALLOC_N(struct item_holder*, INIT_BIN);
-    cache->size = INIT_BIN;
-    cache->num = 0;
-    return Data_Wrap_Struct(LALRcoreCache, 0, lalrc_free, cache);
-}
-
-#define GET_LALRC(self, p) Data_Get_Struct(self, struct lalr_state_cache, p)
-
-static void
-lalrc_rehash(struct lalr_state_cache *p)
-{
-    struct item_holder *top = 0, *tmp = 0;
-    long i;
-
-    for (i = p->size / 2; i < p->size; i++) {
-        p->bin[i] = 0;
-    }
-    for (i = 0; i < p->size / 2; i++) {
-        if (!p->bin[i])
-            continue;
-
-        tmp = p->bin[i];
-        while (tmp->next)
-            tmp = tmp->next;
-        tmp->next = top;
-        top = p->bin[i];
-        p->bin[i] = 0;
-    }
-
-    while (top) {
-        tmp = top;
-        top = tmp->next;
-        tmp->next = 0;
-
-        i = tmp->hashval % p->size;
-        if (p->bin[i]) {
-            tmp->next = p->bin[i];
-            p->bin[i] = tmp;
-        }
-        else {
-            p->bin[i] = tmp;
-        }
-    }
-}
-
-static int
-coreeql(VALUE a, VALUE b)
-{
-    long i;
-
-    /* Check_Type(a, T_ARRAY);
-    Check_Type(b, T_ARRAY); */
-    if (RARRAY(a)->len != RARRAY(b)->len)
-        return 0;
-    for (i = 0; i < RARRAY(a)->len; i++)
-        if (RARRAY(a)->ptr[i] != RARRAY(b)->ptr[i])
-            return 0;
-    
-    return 1;
-}
-
-static unsigned long
-hashval(VALUE core)
-{
-    unsigned long v = 0;
-    long i, j;
-
-    for (i = 0; i < RARRAY(core)->len; i++) {
-        v *= RARRAY(core)->ptr[i];
-        v ^= RARRAY(core)->ptr[i];
-    }
-    return v;
-}
-
-static VALUE
-lalrc_aref(VALUE self, VALUE core)
-{
-    struct lalr_state_cache *p;
-    unsigned long v;
-    long i;
-    struct item_holder *ad;
-
-    /* Check_Type(core, T_ARRAY); */
-    GET_LALRC(self, p);
-    v = hashval(core);
-    i = v % p->size;
-    ad = p->bin[i];
-    while (ad) {
-        if (ad->hashval == v) {
-            if (coreeql(core, ad->core)) {
-                return ad->state;
-            }
-            else {
-printf(".");
-            }
-        }
-        ad = ad->next;
-    }
-    return Qnil;
-}
-
-static VALUE
-lalrc_add_direct(VALUE self, VALUE core, VALUE state)
-{
-    struct lalr_state_cache *p;
-    struct item_holder *ad;
-    long i;
-
-    GET_LALRC(self, p);
-    ad = ALLOC_N(struct item_holder, 1);
-    ad->hashval = hashval(core);
-    ad->core = core;
-    ad->state = state;
-
-    i = ad->hashval % p->size;
-    ad->next = p->bin[i];
-    p->bin[i] = ad;
-    p->num++;
-    if ((p->num / p->size) >= 1) {
-        REALLOC_N(p->bin, struct item_holder*, p->size * 2);
-        p->size *= 2;
-        lalrc_rehash(p);
-    }
-    return Qnil;
-}
-
-void
-Init_corecache(void)
-{
-    LALRcoreCache = rb_define_class("LALRcoreCache", rb_cObject);
-    rb_define_singleton_method(LALRcoreCache, "new", lalrc_s_new, 0);
-    rb_define_method(LALRcoreCache, "[]", lalrc_aref, 1);
-    rb_define_method(LALRcoreCache, "[]=", lalrc_add_direct, 2);
-}

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/misc/dist.sh

@@ -1,31 +0,0 @@
-#!/bin/sh
-
-rm -rf tmp
-mkdir tmp
-cd tmp
-
-# racc, raccrt
-cvs -Q export -r`echo V$version | tr . -` -d racc-$version racc
-cd racc-$version
-    make bootstrap lib/racc/parser-text.rb doc
-    rm -r doc web bits fastcache
-cd ..
-mkdir -p raccrt-$version/lib/racc
-mv racc-$version/lib/racc/parser.rb     raccrt-$version/lib/racc
-mv racc-$version/ext                    raccrt-$version
-cp racc-$version/setup.rb               raccrt-$version
-cp racc-$version/README.*               raccrt-$version
-cp racc-$version/COPYING                raccrt-$version
-tar czf $ardir/racc/racc-$version.tar.gz racc-$version
-tar czf $ardir/raccrt/raccrt-$version.tar.gz raccrt-$version
-
-# -all
-mkdir -p racc-$version-all/packages
-cp racc-$version/setup.rb racc-$version-all
-cp racc-$version/README.* racc-$version-all
-mv racc-$version          racc-$version-all/packages/racc
-mv raccrt-$version        racc-$version-all/packages/raccrt
-tar czf $ardir/racc/racc-$version-all.tar.gz racc-$version-all
-
-cd ..
-rm -rf tmp

data/sample/array.y

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

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

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

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

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

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

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

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

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