opal 0.2.2 → 0.3.0

data/gems/dev/lib/dev/string_scanner.js

@@ -0,0 +1,38 @@
+var StringScanner = function(str) {
+    this._str = str;
+    this._at = 0;
+    this.matched = "";
+    return this._workingString = str;
+};
+StringScanner.prototype.scan = function(reg) {
+    var res;
+    res = reg.exec(this._workingString);
+    if (res === null) {
+        this.matched = "";
+        return false;
+    } else if (typeof res === "object") {
+        this._at += res[0].length;
+        this._workingString = this._workingString.substr(res[0].length);
+        this.matched = res[0];
+        return res;
+    } else if (typeof res === "string") {
+        this._at += res.length;
+        this._workingString = this._workingString.substr(res.length);
+        return res;
+    } else {
+        return false;
+    };
+};
+
+StringScanner.prototype.check = function(reg) {
+    return reg.exec(this._workingString);
+};
+StringScanner.prototype.peek = function(len) {
+    return this._workingString.substr(0, len);
+};
+
+StringScanner.prototype.eos = function() {
+  return this._workingString.length == 0;
+};
+
+exports.StringScanner = StringScanner;

data/gems/dev/tools/racc2js/README.md

@@ -0,0 +1,39 @@
+racc2js
+=======
+
+racc2js is a ruby tool used to convert racc based parser files into javascript
+which can be run in any browser/commonjs environment. It is used within opal for
+both client and server side ruby parsing.
+
+Usage
+=====
+
+    path/to/racc2js.rb input.y [output.js]
+    
+Output file is optional, and defaults to the same name as the input. A .rb file
+will also be created in the same directory for temp purposes, but will be
+deleted on completion.
+
+License
+=======
+
+Created by Adam Beynon.
+Copyright 2010 Adam Beynon.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/gems/dev/tools/racc2js/math_parser.js

@@ -0,0 +1,222 @@
+var MathParser = function() {
+  
+};
+
+MathParser.prototype.do_parse = function() {
+  return this.do_parse_js(MathParser.Racc_arg, false);
+};
+
+MathParser.prototype.do_parse_js = function(arg, in_debug) {
+  var action_table    = arg[0],
+      action_check    = arg[1],
+      action_default  = arg[2],
+      action_pointer  = arg[3],
+      
+      goto_table      = arg[4],
+      goto_check      = arg[5],
+      goto_default    = arg[6],
+      goto_pointer    = arg[7],
+      
+      nt_base         = arg[8],
+      reduce_table    = arg[9],
+      token_table     = arg[10],
+      shift_n         = arg[11],
+      reduce_n        = arg[12],
+      
+      use_result      = arg[13];
+  
+  // racc sys vars
+  var racc_state      = [0],
+      racc_tstack     = [],
+      racc_vstack     = [],
+      
+      racc_t          = null,
+      racc_tok        = null,
+      racc_val        = null,
+      racc_read_next  = true,
+      
+      racc_user_yyerror = false,
+      racc_error_status = 0;
+  
+  var token = null, act = null, i = null, nerr = 0, curstate = null;
+  
+  while (true) {
+    console.log('looping');
+    if ((i = action_pointer[racc_state[racc_state.length - 1]]) !== null) {
+      console.log('yeap');
+      if (racc_read_next) {
+        if (racc_t !== 0) { // not EOF
+          token = this.next_token();
+          racc_tok = token[0];
+          racc_val = token[1];
+          
+          console.log('token is: ' + token.join(','));
+          
+          if (!racc_tok) { // EOF
+            racc_t = 0;
+          }
+          else {
+            racc_t = token_table[racc_tok];
+            if (racc_t === undefined) racc_t = 1;
+          }
+          
+          console.log('racc_t: ' + racc_t);
+          
+          racc_read_next = false;
+        }
+      }
+            
+      i += racc_t;
+      
+      console.log('i is now ' + i);
+      
+      if ((i < 0) || ((act = action_table[i]) === null) || (action_check[i] !== racc_state[racc_state.length - 1])) {
+        act = action_default[racc_state[racc_state.length - 1]];
+      }
+    }
+    else {
+      act = action_default[racc_state[racc_state.length - 1]];
+    }
+    
+    console.log('act is: ' + act);
+    
+    // ================
+    // = racc_evalact =
+    // ================
+    
+    if (act > 0 && act < shift_n) {
+      console.log('shift on ' + act);
+      // 
+      // shift
+      // 
+      if (racc_error_status > 0) {
+        // error token
+        console.log('err part 1');
+        if (racc_t !== 1) {
+          console.log('err part 2');
+          racc_error_status -= 1;
+        }
+      }
+      
+      racc_vstack.push(racc_val);
+      curstate = act;
+      racc_state.push(act);
+      racc_read_next = true;
+    }
+    else if (act < 0 && act > -reduce_n) {
+      console.log('~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ reduce on ' + act);
+      // 
+      // reduce
+      // 
+      var reduce_i    = act * -3,
+          reduce_len  = reduce_table[reduce_i],
+          reduce_to   = reduce_table[reduce_i + 1],
+          method_id   = reduce_table[reduce_i + 2];
+      
+      var tmp_v = racc_vstack.slice(racc_vstack.length - reduce_len);
+      console.log('reduce len is: ' + reduce_len);
+      console.log('tmp_v is: ' + tmp_v.join(', '));
+      
+      // pop for number of reductions
+      while(reduce_len--) {
+        console.log('popping: ' + reduce_len);
+        racc_state.pop();
+        racc_vstack.pop();
+        racc_tstack.pop();
+      }
+      
+      if (use_result) {
+        // msgsend..we push on result of method call..?
+        console.log('reducing: ' + method_id);
+        console.log('['+tmp_v.join(', ')+']');
+        console.log('[' + racc_vstack.join(', ') + ']');
+        // racc_vstack.push(method_id);
+        console.log("NEED TO EXECUTE: [" + tmp_v.join(',') + ']');
+        console.log(this[method_id]);
+        var reduce_call_result = this[method_id](tmp_v, tmp_v[0]);
+        console.log(reduce_call_result);
+        racc_vstack.push(reduce_call_result);
+      }
+      else {
+        throw "not using result?!?!?!?!?!";
+      }
+      
+      racc_tstack.push(reduce_to);
+      
+      console.log('VSTACK: [' + racc_vstack.join(', ') + ']');
+      
+      var k1 = reduce_to - nt_base;
+      console.log('k1 is ' +k1);
+      console.log("goto pointer is: " + goto_pointer[k1]);
+      if ((reduce_i = goto_pointer[k1]) !== null) {
+        
+        reduce_i += racc_state[racc_state.length - 1];
+        console.log("reduce_i is now: " + reduce_i);
+        console.log("-- potential curstate is: " + goto_table[reduce_i]);
+        if ((reduce_i >= 0) && ((curstate = goto_table[reduce_i]) !== null) &&
+                (curstate !== undefined) && (goto_check[reduce_i] === k1)) {
+          // curstate = curstate; ..?
+          console.log('========== return current state: ' + curstate);
+          racc_state.push(curstate);
+        }
+        else {//
+          // console.log("dont do this??");
+          // curstate = k1;
+          console.log("=========== PUSHING curstate " + curstate);
+          console.log('=========== goto default is: ' + goto_default[k1]);
+          racc_state.push(goto_default[k1]);
+        }
+        // tmp_v is return value from stack
+        // racc_vstack.push(tmp_v[0]);
+        
+      }
+      else {
+        console.log('GOTO default down here init!!!!!!!!!!!');
+        racc_state.push(goto_default[k1]);
+      }
+      
+      // return;
+    }
+    else if (act === shift_n) {
+      console.log('accept on ' + act);
+      // 
+      // accept
+      // 
+      console.log('accepting!!!!');
+      console.log(racc_vstack[0]);
+      return racc_vstack[0];
+    }
+    else if (act === -reduce_n) {
+      console.log('error on ' + act);
+      // 
+      // error
+      // 
+      console.log('racc error status: ' + racc_error_status);
+      console.log(racc_tok + ", " + racc_val);
+      return;
+    }
+    else {
+      throw "Racc - unknown action: " + act;
+    }
+    
+    // return;
+  }  
+};
+
+MathParser.prototype.next_token = function() {
+  throw "next_token is not defined for parser."
+};
+
+MathParser.prototype._reduce_none = function(val, result) {
+  return result;
+};
+MathParser.Racc_arg = [
+[3,3,3,3,9,5,4,4,4,4,6,6,7,7,6,12],[0,6,7,4,5,1,0,6,7,4,8,2,8,2,11,8],[-6,-6,-1,-5,-6,-6,-6,-6,-6,13,-3,-2,-4],[-2,5,7,null,1,4,-1,0,6,null,null,10,null],[2,1,null,null,8,null,10,11],[2,1,null,null,2,null,2,2],[null,null,null],[null,1,0],10,[0,0,"racc_error",1,11,"_reduce_1",3,12,"_reduce_2",3,12,"_reduce_none",3,12,"_reduce_none",1,12,"_reduce_none"],{"+": 6,"UMINUS": 3,"false": 0,"-": 7,"/": 5,"error": 1,"(": 8,")": 9,"NUMBER": 2,"*": 4},13,6,true];
+        MathParser.prototype._reduce_1 = function(val, result) {
+          result = val[0];
+          return result;
+        };
+        MathParser.prototype._reduce_2 = function(val, result) {
+          a, b, c
+          return result;
+        };

data/gems/dev/tools/racc2js/math_parser.rb

@@ -0,0 +1,133 @@
+#
+# DO NOT MODIFY!!!!
+# This file is automatically generated by Racc 1.4.6
+# from Racc grammer file "".
+#
+
+require 'racc/parser.rb'
+class MathParser < Racc::Parser
+
+module_eval(<<'...end math_parser.y/module_eval...', 'math_parser.y', 29)
+
+...end math_parser.y/module_eval...
+##### State transition tables begin ###
+
+racc_action_table = [
+     3,     3,     3,     3,     9,     5,     4,     4,     4,     4,
+     6,     6,     7,     7,     6,    12 ]
+
+racc_action_check = [
+     0,     6,     7,     4,     5,     1,     0,     6,     7,     4,
+     8,     2,     8,     2,    11,     8 ]
+
+racc_action_pointer = [
+    -2,     5,     7,   nil,     1,     4,    -1,     0,     6,   nil,
+   nil,    10,   nil ]
+
+racc_action_default = [
+    -6,    -6,    -1,    -5,    -6,    -6,    -6,    -6,    -6,    13,
+    -3,    -2,    -4 ]
+
+racc_goto_table = [
+     2,     1,   nil,   nil,     8,   nil,    10,    11 ]
+
+racc_goto_check = [
+     2,     1,   nil,   nil,     2,   nil,     2,     2 ]
+
+racc_goto_pointer = [
+   nil,     1,     0 ]
+
+racc_goto_default = [
+   nil,   nil,   nil ]
+
+racc_reduce_table = [
+  0, 0, :racc_error,
+  1, 11, :_reduce_1,
+  3, 12, :_reduce_2,
+  3, 12, :_reduce_none,
+  3, 12, :_reduce_none,
+  1, 12, :_reduce_none ]
+
+racc_reduce_n = 6
+
+racc_shift_n = 13
+
+racc_token_table = {
+  false => 0,
+  :error => 1,
+  :NUMBER => 2,
+  :UMINUS => 3,
+  "*" => 4,
+  "/" => 5,
+  "+" => 6,
+  "-" => 7,
+  "(" => 8,
+  ")" => 9 }
+
+racc_nt_base = 10
+
+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",
+  "NUMBER",
+  "UMINUS",
+  "\"*\"",
+  "\"/\"",
+  "\"+\"",
+  "\"-\"",
+  "\"(\"",
+  "\")\"",
+  "$start",
+  "target",
+  "exp" ]
+
+Racc_debug_parser = false
+
+##### State transition tables end #####
+
+# reduce 0 omitted
+
+module_eval(<<'.,.,', 'math_parser.y', 15)
+  def _reduce_1(val, _values, result)
+     result = "result = val[0];" 
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'math_parser.y', 19)
+  def _reduce_2(val, _values, result)
+                    result = "a, b, c"
+              
+    result
+  end
+.,.,
+
+# reduce 3 omitted
+
+# reduce 4 omitted
+
+# reduce 5 omitted
+
+def _reduce_none(val, _values, result)
+  val[0]
+end
+
+end   # class MathParser

data/gems/dev/tools/racc2js/math_parser.y

@@ -0,0 +1,28 @@
+# 
+# Demo parser file for racc2js
+# 
+
+class MathParser
+
+token NUMBER
+
+      prechigh
+        nonassoc UMINUS
+        left '*' '/'
+        left '+' '-'
+      preclow
+
+      rule
+        target: exp { result = "result = val[0];" }
+
+        exp: exp '+' exp
+              {
+                result = "a, b, c"
+              }
+           | exp '*' exp
+           | '(' exp ')'
+           | NUMBER
+
+end
+
+---- inner