rubex 0.0.1

data/lib/rubex/lexer.rex.rb

@@ -0,0 +1,129 @@
+# encoding: UTF-8
+#--
+# This file is automatically generated. Do not modify it.
+# Generated by: oedipus_lex version 2.4.1.
+# Source: lib/rubex/lexer.rex
+#++
+
+class Rubex::Lexer
+  require 'strscan'
+
+  DEF        = /def/
+  RETURN     = /return/
+  IDENTIFIER = /[a-z_][a-zA-Z_0-9]*/
+  LPAREN     = /\(/
+  RPAREN     = /\)/
+  NL         = /\n/
+  COMMA      = /,/
+  EXPO       = /\*\*/
+  MULTIPLY   = /\*/
+  DIVIDE     = /\//
+  PLUS       = /\+/
+  MINUS      = /\-/
+  MODULUS    = /%/
+  EQUAL      = /=/
+
+  class ScanError < StandardError ; end
+
+  attr_accessor :filename
+  attr_accessor :ss
+  attr_accessor :state
+
+  alias :match :ss
+
+  def matches
+    m = (1..9).map { |i| ss[i] }
+    m.pop until m[-1] or m.empty?
+    m
+  end
+
+  def action
+    yield
+  end
+
+
+  def scanner_class
+    StringScanner
+  end unless instance_methods(false).map(&:to_s).include?("scanner_class")
+
+  def parse str
+    self.ss     = scanner_class.new str
+    self.state  ||= nil
+
+    do_parse
+  end
+
+  def parse_file path
+    self.filename = path
+    open path do |f|
+      parse f.read
+    end
+  end
+
+  def next_token
+
+    token = nil
+
+    until ss.eos? or token do
+      token =
+        case state
+        when nil then
+          case
+          when text = ss.scan(/#{DEF}/) then
+            action { [:kDEF, text] }
+          when text = ss.scan(/end/) then
+            action { [:kEND, text]  }
+          when text = ss.scan(/#{RETURN}/) then
+            action { [:kRETURN, text] }
+          when text = ss.scan(/i32/) then
+            action { [:kDTYPE_I32, text] }
+          when text = ss.scan(/#{IDENTIFIER}/) then
+            action { [:tIDENTIFIER, text] }
+          when text = ss.scan(/#{LPAREN}/) then
+            action { [:tLPAREN, text] }
+          when text = ss.scan(/#{RPAREN}/) then
+            action { [:tRPAREN, text] }
+          when text = ss.scan(/#{NL}/) then
+            action { [:tNL, text] }
+          when text = ss.scan(/#{COMMA}/) then
+            action { [:tCOMMA, text] }
+          when text = ss.scan(/#{PLUS}/) then
+            action { [:tPLUS, text]}
+          when text = ss.scan(/#{MINUS}/) then
+            action { [:tMINUS, text]}
+          when text = ss.scan(/#{MULTIPLY}/) then
+            action { [:tMULTIPLY, text]}
+          when text = ss.scan(/#{DIVIDE}/) then
+            action { [:tDIVIDE, text]}
+          when text = ss.scan(/#{EXPO}/) then
+            action { [:tEXPO, text]}
+          when text = ss.scan(/#{MODULUS}/) then
+            action { [:tMODULUS, text]}
+          when text = ss.scan(/#{EXPO}/) then
+            action { [:tEXPO, text]}
+          when ss.skip(/ /) then
+            action {}
+          else
+            text = ss.string[ss.pos .. -1]
+            raise ScanError, "can not match (#{state.inspect}): '#{text}'"
+          end
+        else
+          raise ScanError, "undefined state: '#{state}'"
+        end # token = case state
+
+      next unless token # allow functions to trigger redo w/ nil
+    end # while
+
+    raise "bad lexical result: #{token.inspect}" unless
+      token.nil? || (Array === token && token.size >= 2)
+
+    # auto-switch state
+    self.state = token.last if token && token.first == :state
+
+    token
+  end # def next_token
+    def do_parse
+    end
+end # class
+
+   # Rubex::Lexer

data/lib/rubex/parser.racc

@@ -0,0 +1,67 @@
+class Rubex::Parser
+token 
+  kDEF kEND kRETURN kDTYPE_I32 tLPAREN tRPAREN tIDENTIFIER tPLUS tNL tCOMMA
+
+prechigh
+  left tEXPO
+  left tMULTIPLY tDIVIDE tMODULUS
+  left tPLUS tMINUS
+
+  right tEQUAL
+preclow
+
+rule
+
+  program:
+    stmts { result = Node.new(val[0]) }
+
+  stmts:
+    stmts stmt tNL { result = [val[0], val[1]] }
+  | stmt tNL { result = [val[0]] }
+  
+  stmt: 
+    kDEF fname f_arglist stmts kEND 
+      { 
+        result = RubyMethodDef.new(val[1], val[2])
+        result.add_statements val[3]
+      }
+  | kRETURN expr { result = Statement::Return.new val[1] }
+  | {}
+
+  fname:
+    tIDENTIFIER {}
+
+  f_arglist:
+    tLPAREN f_args tRPAREN tNL { result = val[1] }
+
+  f_args:
+    f_args tCOMMA f_normal_arg 
+      { 
+        result = ArgumentList.new
+        result.push val[0]
+        result.push val[2]
+      } 
+  | f_normal_arg { }
+
+  f_normal_arg:
+    kDTYPE_I32 tIDENTIFIER { result = CBaseType.new val[0], val[1] }
+
+  expr:
+    tIDENTIFIER tPLUS tIDENTIFIER { result = Expression::Addition.new val[0], val[2] }
+end
+
+---- header
+require_relative 'lexer.rex.rb'
+require_relative 'ast.rb'
+
+include Rubex::AST
+
+---- inner
+def parse file_name
+  @lexer = Rubex::Lexer.new
+  @lexer.parse_file file_name
+end
+
+def next_token
+  @lexer.next_token
+end

data/lib/rubex/parser.racc.rb

@@ -0,0 +1,251 @@
+#
+# DO NOT MODIFY!!!!
+# This file is automatically generated by Racc 1.4.14
+# from Racc grammer file "".
+#
+
+require 'racc/parser.rb'
+
+require_relative 'lexer.rex.rb'
+require_relative 'ast.rb'
+
+include Rubex::AST
+
+module Rubex
+  class Parser < Racc::Parser
+
+module_eval(<<'...end parser.racc/module_eval...', 'parser.racc', 60)
+def parse file_name
+  @lexer = Rubex::Lexer.new
+  @lexer.parse_file file_name
+end
+
+def next_token
+  @lexer.next_token
+end
+...end parser.racc/module_eval...
+##### State transition tables begin ###
+
+racc_action_table = [
+     4,    24,     5,     6,     4,    25,     5,     4,    -6,     5,
+     4,    23,     5,     8,    10,    12,    13,    14,    16,    17,
+    21,    22,    26,    27,    21 ]
+
+racc_action_check = [
+     2,    19,     2,     1,     0,    19,     0,    15,     2,    15,
+    18,    18,    18,     3,     4,     5,     6,     7,     9,    12,
+    16,    17,    21,    24,    25 ]
+
+racc_action_pointer = [
+     2,     3,    -2,     3,     6,     7,    16,     7,   nil,    12,
+   nil,   nil,    10,   nil,   nil,     5,    15,    13,     8,    -6,
+   nil,    14,   nil,   nil,    13,    19,   nil,   nil,   nil ]
+
+racc_action_default = [
+    -6,   -13,    -1,   -13,   -13,   -13,   -13,   -13,    -3,   -13,
+    -7,    -5,   -13,    29,    -2,    -6,   -13,   -13,    -6,   -13,
+   -10,   -13,   -12,    -4,   -13,   -13,   -11,    -8,    -9 ]
+
+racc_goto_table = [
+     7,    20,     2,     1,     9,    15,    11,    19,   nil,   nil,
+    28,   nil,   nil,   nil,   nil,   nil,     7,    18 ]
+
+racc_goto_check = [
+     3,     8,     2,     1,     4,     5,     6,     7,   nil,   nil,
+     8,   nil,   nil,   nil,   nil,   nil,     3,     2 ]
+
+racc_goto_pointer = [
+   nil,     3,     2,    -2,     0,    -4,     1,    -9,   -15 ]
+
+racc_goto_default = [
+   nil,   nil,   nil,     3,   nil,   nil,   nil,   nil,   nil ]
+
+racc_reduce_table = [
+  0, 0, :racc_error,
+  1, 19, :_reduce_1,
+  3, 20, :_reduce_2,
+  2, 20, :_reduce_3,
+  5, 21, :_reduce_4,
+  2, 21, :_reduce_5,
+  0, 21, :_reduce_6,
+  1, 22, :_reduce_7,
+  4, 23, :_reduce_8,
+  3, 25, :_reduce_9,
+  1, 25, :_reduce_10,
+  2, 26, :_reduce_11,
+  3, 24, :_reduce_12 ]
+
+racc_reduce_n = 13
+
+racc_shift_n = 29
+
+racc_token_table = {
+  false => 0,
+  :error => 1,
+  :kDEF => 2,
+  :kEND => 3,
+  :kRETURN => 4,
+  :kDTYPE_I32 => 5,
+  :tLPAREN => 6,
+  :tRPAREN => 7,
+  :tIDENTIFIER => 8,
+  :tPLUS => 9,
+  :tNL => 10,
+  :tCOMMA => 11,
+  :tEXPO => 12,
+  :tMULTIPLY => 13,
+  :tDIVIDE => 14,
+  :tMODULUS => 15,
+  :tMINUS => 16,
+  :tEQUAL => 17 }
+
+racc_nt_base = 18
+
+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 ]
+
+Racc_token_to_s_table = [
+  "$end",
+  "error",
+  "kDEF",
+  "kEND",
+  "kRETURN",
+  "kDTYPE_I32",
+  "tLPAREN",
+  "tRPAREN",
+  "tIDENTIFIER",
+  "tPLUS",
+  "tNL",
+  "tCOMMA",
+  "tEXPO",
+  "tMULTIPLY",
+  "tDIVIDE",
+  "tMODULUS",
+  "tMINUS",
+  "tEQUAL",
+  "$start",
+  "program",
+  "stmts",
+  "stmt",
+  "fname",
+  "f_arglist",
+  "expr",
+  "f_args",
+  "f_normal_arg" ]
+
+Racc_debug_parser = false
+
+##### State transition tables end #####
+
+# reduce 0 omitted
+
+module_eval(<<'.,.,', 'parser.racc', 15)
+  def _reduce_1(val, _values, result)
+     result = Node.new(val[0]) 
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 18)
+  def _reduce_2(val, _values, result)
+     result = [val[0], val[1]] 
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 19)
+  def _reduce_3(val, _values, result)
+     result = [val[0]] 
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 24)
+  def _reduce_4(val, _values, result)
+            result = RubyMethodDef.new(val[1], val[2])
+        result.add_statements val[3]
+      
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 27)
+  def _reduce_5(val, _values, result)
+     result = Statement::Return.new val[1] 
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 28)
+  def _reduce_6(val, _values, result)
+    
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 31)
+  def _reduce_7(val, _values, result)
+    
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 34)
+  def _reduce_8(val, _values, result)
+     result = val[1] 
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 39)
+  def _reduce_9(val, _values, result)
+            result = ArgumentList.new
+        result.push val[0]
+        result.push val[2]
+      
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 43)
+  def _reduce_10(val, _values, result)
+     
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 46)
+  def _reduce_11(val, _values, result)
+     result = CBaseType.new val[0], val[1] 
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'parser.racc', 49)
+  def _reduce_12(val, _values, result)
+     result = Expression::Addition.new val[0], val[2] 
+    result
+  end
+.,.,
+
+def _reduce_none(val, _values, result)
+  val[0]
+end
+
+  end   # class Parser
+  end   # module Rubex

data/lib/rubex/symbol_table.rb

@@ -0,0 +1,2 @@
+require 'rubex/symbol_table/scope'
+require 'rubex/symbol_table/entry'