X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.js;h=c424e5ba7a04834390c737890085beb366a128c9;hb=4fd4c8a4b69464bf1ac74af920175308656e6f6b;hp=411e166d95894b49998c1f4b59f51f567f5a11d5;hpb=cf712efc21fa3a711b8a09b953539c7a7c90f5d6;p=clo

diff --git a/src/index.js b/src/index.js
index 411e166..c424e5b 100644
--- a/src/index.js
+++ b/src/index.js
@@ -1,404 +1,404 @@
 "use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.tokenize = exports.zeroOrOnceDo = exports.notDo = exports.zeroOrMoreDo = exports.orDo = exports.thenDo = exports.charToCodepoint = exports.matchRange = exports.matchAny = exports.match1Char = exports.TokenType = void 0;
+exports.OnceOrMoreDo = exports.matchAny = exports.m1TType = exports.tkTreeToSExp = void 0;
 var fs = require('fs');
+const node_process_1 = require("node:process");
+const tk = __importStar(require("./tokenize.js"));
+const util = __importStar(require("util"));
 /**
- * wrap a x in a `Some(T)`
- * @param x : variable to be wrapped.
- * @returns wrapped `x`.
+ * debug reprensenting
  */
-function toSome(x) {
-    return { _tag: "Some", value: x };
-}
+let repr = (x) => { return util.inspect(x, { depth: null }); };
 /**
- * The types of Token
- *    NL, // newline
- *
- *   SP, // half-width space and tab
- *
- * ID, // identifier
- *
- * STR, // string
- *
- * OP, // operator or something like it
- *
- * FLO, // float num
- *
- * INT, // integer
- *
- * I_* // integer manipulation
- *
- * F_* // float manipulation
- *
- * SEMI_C// semi-colon
- */
-var TokenType;
-(function (TokenType) {
-    TokenType[TokenType["NL"] = 0] = "NL";
-    TokenType[TokenType["SP"] = 1] = "SP";
-    TokenType[TokenType["ID"] = 2] = "ID";
-    TokenType[TokenType["STR"] = 3] = "STR";
-    TokenType[TokenType["FLO"] = 4] = "FLO";
-    TokenType[TokenType["INT"] = 5] = "INT";
-    TokenType[TokenType["F_ADD"] = 6] = "F_ADD";
-    TokenType[TokenType["F_SUB"] = 7] = "F_SUB";
-    TokenType[TokenType["F_MUL"] = 8] = "F_MUL";
-    TokenType[TokenType["F_DIV"] = 9] = "F_DIV";
-    TokenType[TokenType["I_ADD"] = 10] = "I_ADD";
-    TokenType[TokenType["I_SUB"] = 11] = "I_SUB";
-    TokenType[TokenType["I_MUL"] = 12] = "I_MUL";
-    TokenType[TokenType["I_DIV"] = 13] = "I_DIV";
-    TokenType[TokenType["L_PAREN"] = 14] = "L_PAREN";
-    TokenType[TokenType["R_PAREN"] = 15] = "R_PAREN";
-    TokenType[TokenType["L_BRACK"] = 16] = "L_BRACK";
-    TokenType[TokenType["R_BRACK"] = 17] = "R_BRACK";
-    TokenType[TokenType["L_BRACE"] = 18] = "L_BRACE";
-    TokenType[TokenType["R_BRACE"] = 19] = "R_BRACE";
-    TokenType[TokenType["COMMA"] = 20] = "COMMA";
-    TokenType[TokenType["DOT"] = 21] = "DOT";
-    TokenType[TokenType["COLON"] = 22] = "COLON";
-    TokenType[TokenType["SEMI_C"] = 23] = "SEMI_C";
-    TokenType[TokenType["AT"] = 24] = "AT";
-    TokenType[TokenType["HASH"] = 25] = "HASH";
-    TokenType[TokenType["EQ"] = 26] = "EQ";
-    TokenType[TokenType["SET"] = 27] = "SET";
-    TokenType[TokenType["GT"] = 28] = "GT";
-    TokenType[TokenType["LT"] = 29] = "LT";
-    TokenType[TokenType["GE"] = 30] = "GE";
-    TokenType[TokenType["LE"] = 31] = "LE";
-    TokenType[TokenType["R_ARROW"] = 32] = "R_ARROW";
-})(TokenType || (exports.TokenType = TokenType = {}));
-/**
- * @description
- * it returns a function which test if the first char of the `remained` part of
- *  the argument of the function is `c`, if it's true, update the `MatchedPair` wrapped
- * in `Some`. Otherwise, it returns `None`.
- *  * @param c : the char to be test.
- * @returns the updated `MatchedPair` wrapped in `Some(x)` or `None`.
+ * concated 2 `tkTree`s
+ * @param x the array to be concated
+ * @param y the item or array to ve concated
+ * @returns concated tkTree array, or thrown error if can't be concated.
  */
-function match1Char(c) {
-    return (m) => {
-        if (m.remained.length == 0) {
-            return { _tag: "None" };
-        }
-        const charToBeMatched = m.remained[0];
-        if (charToBeMatched === c) {
-            return { _tag: "Some", value: {
-                    matched: m.matched + charToBeMatched,
-                    remained: m.remained.substring(1)
-                } };
-        }
-        else {
-            return { _tag: "None" };
-        }
-    };
+function concat(x, y) {
+    if (Array.isArray(x)) {
+        return x.concat(y);
+    }
+    else {
+        throw new Error("the tkTree can't be concated, because it's not an array.");
+    }
+}
+function slice(x, index, end) {
+    if (Array.isArray(x)) {
+        return x.slice(index, end);
+    }
+    else {
+        throw new Error("the tkTree can't be concated, because it's not an array.");
+    }
 }
-exports.match1Char = match1Char;
-;
 /**
- *
- * @param m : the `MatcheePair` to be consumed.
- * @returns if the length of `m.remained` >= 1; consumes the matchee by 1 char and wraps it in `Some`,
- * otherwise, returns `None`.
+ * convert a `tkTree` AST to S-expr string
+ * @param t the `tkTree`
+ * @returns S-expr String
  */
-function matchAny(m) {
-    if (m.remained.length >= 1) {
-        return { _tag: "Some", value: {
-                matched: m.matched + m.remained[0],
-                remained: m.remained.substring(1)
-            } };
+function tkTreeToSExp(t) {
+    var str = "";
+    if (Array.isArray(t)) {
+        let strArray = t.map((x) => tkTreeToSExp(x));
+        str = "(" + strArray.join(" ") + ")";
     }
     else {
-        return { _tag: "None" };
+        if (t === undefined) {
+            str = "%undefined";
+        }
+        else {
+            str = t.text;
+        }
     }
+    return str;
 }
-exports.matchAny = matchAny;
+exports.tkTreeToSExp = tkTreeToSExp;
 /**
  * @description
- * it returns a function which test if the first char of the `remained` part of
- *  the argument of the function is between `l` and `u`, if it's true, update the `MatchedPair` wrapped
+ * match one token type.
+ *
+ * it returns a function which test if the type of first token of the `remained` part of
+ *  the argument of the function is `typ` , if it's true, update the `TokenMatcheePair` wrapped
  * in `Some`. Otherwise, it returns `None`.
- *  * @param l : lower bound char, 1-char string
- *  * @param u : upper bound char, 1-char string
- * @returns the updated `MatchedPair` wrapped in `Some(x)` or `None`.
+ *  * @param typ : the type to be test.
+ * @returns the updated `TokenMatcheePair` wrapped in `Some(x)` or `None`.
  */
-function matchRange(l, u) {
-    let lCodepoint = charToCodepoint(l);
-    let uCodepoint = charToCodepoint(u);
-    if (l > u) {
-        throw new Error("Error: the codepoint of `" + l + "` is not smaller than `" + u + "`)");
-    }
+function m1TType(typ) {
     return (m) => {
-        if (m.remained.length < 1) {
+        if (m.remained.length == 0) {
             return { _tag: "None" };
         }
-        const charToBeMatched = m.remained[0];
-        const codePointToBeMatched = charToCodepoint(charToBeMatched);
-        if (codePointToBeMatched >= lCodepoint && codePointToBeMatched <= uCodepoint) {
-            return { _tag: "Some", value: {
-                    matched: m.matched + charToBeMatched,
-                    remained: m.remained.substring(1)
-                } };
+        /**
+         * token to be matched
+         * */
+        const ttbm = m.remained[0];
+        if (ttbm.type == typ) {
+            let new_matched = m.matched.concat(ttbm);
+            let result = {
+                _tag: "Some", value: {
+                    matched: new_matched,
+                    remained: m.remained.slice(1),
+                    ast: ([ttbm]),
+                }
+            };
+            return result;
         }
         else {
             return { _tag: "None" };
         }
     };
 }
-exports.matchRange = matchRange;
+exports.m1TType = m1TType;
 ;
 /**
- * convert the one-char string to codepoint.
- * @param s : the string to code point.
- * @returns if `s.length > 1` return error; otherwise, return the codepoint of `s`.
+ * type int
  */
-function charToCodepoint(s) {
-    if (s.length > 1) {
-        throw new Error("Error: the length of input string for " + s + "is " + s.length + `,
-        however, it should be 1.`);
-    }
-    else {
-        return s.charCodeAt(0);
-    }
-}
-exports.charToCodepoint = charToCodepoint;
+let tInt = m1TType(tk.TokenType.INT);
+let tId = m1TType(tk.TokenType.ID);
+let tAdd = m1TType(tk.TokenType.I_ADD);
+let tSub = m1TType(tk.TokenType.I_SUB);
+let tMul = m1TType(tk.TokenType.I_MUL);
+let tDiv = m1TType(tk.TokenType.I_DIV);
+let tLParen = m1TType(tk.TokenType.L_PAREN);
+let tRParen = m1TType(tk.TokenType.R_PAREN);
+let tComma = m1TType(tk.TokenType.COMMA);
+let toSome = tk.toSome;
+node_process_1.argv.forEach((val, index) => {
+    console.log(`${index}=${val}`);
+});
 /**
- *  @description thendo(input, f, ...) like
- * a ==> f
- * @param input: the wrapped input.
- * @param f: the function to be applied.
- *
- * @returns:the applied wrapped result `MatcheePair`.
+ * like `m ==> f` in ocaml
+ * @param m matchee wrapped
+ * @param f matching function
+ * @returns wrapped result
  */
-function thenDo(input, f) {
-    if (input._tag == "None") {
-        return input;
+function thenDo(m, f) {
+    if (m._tag == "None") {
+        return m;
     }
     else {
-        let inner = input.value;
-        return f(inner);
+        var a = f(m.value);
+        if (a._tag == "Some") {
+            a.value.ast = concat(m.value.ast, a.value.ast);
+        }
+        return a;
     }
 }
-exports.thenDo = thenDo;
 /**
- * @description "or", like the regex `( f1 | f2 )` .
- * It returns a function `f` of which the argument is`x`.
- * if `f1(x)` is None, then `f` returns `f2(x)`. Otherwise,
- * `F` returns `f1(x)`.
- * @param f1 : 1st function to be compared
- * @param f2 : 2nd function to be compared
- * @returns:the combined function
+ * like `f1 | f2` in regex
+ * @param f1 the first tried function
+ * @param f2 the second tried function
+ * @returns wrapped result
  */
 function orDo(f1, f2) {
     return (x) => {
-        let f1x = (f1(x));
-        {
-            if (f1x._tag == "None") {
-                return f2(x);
-            }
-            else {
-                return f1x;
-            }
+        let res1 = f1(x);
+        if (res1._tag == "Some") {
+            return res1;
+        }
+        else {
+            let res2 = f2(x);
+            return res2;
         }
     };
 }
-exports.orDo = orDo;
 /**
+ *
+ * @param m : the `MatcheePair` to be consumed.
+ * @returns if the length of `m.remained` >= 1; consumes the matchee by 1 token
+ *  and wraps it in `Some`,
+ * otherwise, returns `None`.
+ */
+function matchAny(m) {
+    if (m.remained.length >= 1) {
+        return {
+            _tag: "Some", value: {
+                matched: m.matched.concat(m.remained[0]),
+                remained: m.remained.slice(1),
+                ast: [m.remained[0]],
+            }
+        };
+    }
+    else {
+        return { _tag: "None" };
+    }
+}
+exports.matchAny = matchAny;
+/**
+ * Danger : Maybe it's not enough to work.
 * @description repeating matching function `f`
 * zero or more times, like the asterisk `*` in regex `f*` .
 * @param f : the function to be repeated 0+ times.
 * @returns:the combined function
 */
-function zeroOrMoreDo(f) {
+function OnceOrMoreDo(f) {
     return (x) => {
-        var wrapped_old_x = { _tag: "Some", value: x };
-        var wrapped_new_x = wrapped_old_x;
-        while (wrapped_new_x._tag != "None") {
-            wrapped_old_x = wrapped_new_x;
-            wrapped_new_x = thenDo(wrapped_old_x, f);
+        var wrappedOldX = { _tag: "Some", value: x };
+        var wrappedNewX = wrappedOldX;
+        var counter = -1;
+        while (wrappedNewX._tag != "None") {
+            wrappedOldX = wrappedNewX;
+            wrappedNewX = thenDo(wrappedOldX, f);
+            counter += 1;
         }
         ;
-        return wrapped_old_x;
-    };
-}
-exports.zeroOrMoreDo = zeroOrMoreDo;
-/**
-* @description Not. like the `^` inside regex of [^f].
-* returns a function `F(x)` such that if  `f(x)` is `None`,
-* returns the x consuming a char; if `f(x)` is not None, F(x)
-* returns `None`.
-* @param f: the function forbidden to be matched.
-* @returns: combined function `F`.
-*/
-function notDo(f) {
-    return (x) => {
-        let wrapped_x = {
-            _tag: "Some",
-            value: x
-        };
-        let f_x = thenDo(wrapped_x, f);
-        if (f_x._tag != "None") {
+        if (counter <= 0) {
             return { _tag: "None" };
         }
-        else {
-            return thenDo(wrapped_x, matchAny);
-        }
+        let ast = wrappedOldX.value.ast;
+        wrappedOldX.value.ast = ast.slice(ast.length - counter);
+        console.log(repr(wrappedOldX.value.ast));
+        return wrappedOldX;
     };
 }
-exports.notDo = notDo;
+exports.OnceOrMoreDo = OnceOrMoreDo;
 /**
- * if `x` is matched by `f` once, returns `f(x)`. Otherwise,
- * returns x
- * similar to `?` in regex `f?`.
- * @param f : the function to be matched
- * @returns return wrapped f(x)
+ * aux function for midfix operator
+ * @param f function
+ * @param signal the rule name
+ * @returns
  */
-function zeroOrOnceDo(f) {
-    return (x) => {
-        var wrapped_old_x = { _tag: "Some", value: x };
-        var wrapped_new_x = thenDo(wrapped_old_x, f);
-        if (wrapped_new_x._tag != "None") {
-            return wrapped_new_x;
+let midfix = (f, signal) => (x) => {
+    var a = f(x);
+    if (a._tag == "Some") {
+        let ast_tail = slice(a.value.ast, a.value.ast.length - 3);
+        let new_ast = [ast_tail];
+        a.value.ast = new_ast;
+        // console.log("+"+signal+"+"+repr(a));
+    }
+    return a;
+};
+let circumfix = (f, signal) => (x) => {
+    var a = f(x);
+    if (a._tag == "Some") {
+        console.log("$$$" + repr(a.value.ast));
+        let inner = a.value.ast[a.value.ast.length - 2];
+        var ast_middle;
+        // the list should not be (%list) (%apply) (%lambda) etc.
+        if (Array.isArray(inner)) {
+            if ('text' in inner[0] && (inner[0].text.slice(0, 1) != "%")) {
+                ast_middle = inner;
+            }
+            else {
+                ast_middle = [inner];
+            }
         }
         else {
-            return wrapped_old_x;
+            ast_middle = [inner];
         }
-    };
-}
-exports.zeroOrOnceDo = zeroOrOnceDo;
-function tokenize(input) {
-    var input_matchee_pair = toSome({ matched: "",
-        remained: input });
-    /**
-     * generate a parser of a basic term (b_term)
-     * @param pattern : the pattern parser
-     * @param token_type : the returning token type
-     * @returns a wrapped parser.
-     */
-    function bTerm(pattern, token_type) {
-        return (x) => {
-            let wrapped_x = toSome(x);
-            let result = pattern(wrapped_x);
-            if (result._tag == "Some") {
-                result.value.matched_type = token_type;
-            }
-            return result;
-        };
+        let new_ast = [ast_middle];
+        a.value.ast = new_ast;
     }
-    let d = matchRange('0', '9'); // \d
-    // [+-]
-    let plusMinus = orDo(match1Char('+'), match1Char('-'));
-    let s_aux = orDo(match1Char(' '), match1Char('\t')); // (" " | "\t")
-    // integer = ([+]|[-])?\d\d*
-    let integer = bTerm((x) => thenDo(thenDo(thenDo(x, zeroOrOnceDo(plusMinus)), d), zeroOrMoreDo(d)), TokenType.INT);
-    // space = [ \t]+
-    let space = bTerm((x) => thenDo(thenDo(x, s_aux), zeroOrMoreDo(s_aux)), TokenType.INT);
-    // newline = \r?\n
-    let newline = bTerm((x) => thenDo(thenDo(x, zeroOrOnceDo(match1Char('\r'))), match1Char('\n')), TokenType.NL);
-    // [_A-Za-z]
-    let idHead = orDo(orDo(matchRange('a', 'z'), matchRange('A', 'Z')), match1Char('_'));
-    let idRemained = orDo(idHead, matchRange('0', '9')); // [_A-Za-z0-9]
-    // id = [_A-Za-z][_A-Za-z0-9]*
-    let id = bTerm((x) => thenDo(thenDo(x, idHead), zeroOrMoreDo(idRemained)), TokenType.ID);
-    let doublequote = match1Char("\"");
-    // [\\][\"]
-    let escapeReverseSlash = (x) => thenDo(thenDo(toSome(x), match1Char("\\")), doublequote);
-    // ([\\]["]|[^\"])*
-    let stringInnerPattern = zeroOrMoreDo(orDo(escapeReverseSlash, notDo(match1Char("\""))));
-    // str = ["]([\\]["]|[^"])*["]
-    let str = bTerm((x) => thenDo(thenDo(thenDo(x, doublequote), stringInnerPattern), doublequote), TokenType.STR);
-    // float = [+-]?\d+[.]\d+
-    function floatPattern(x) {
-        return thenDo(thenDo(thenDo(thenDo(thenDo(thenDo(x, zeroOrOnceDo(plusMinus)), d), zeroOrMoreDo(d)), match1Char(".")), d), zeroOrMoreDo(d));
+    return a;
+};
+/** single1 = tInt | "(" expr ")"*/
+let single1 = circumfix((x) => thenDo(thenDo(thenDo(toSome(x), tLParen), expr), tRParen), "fac1");
+let single2 = tInt;
+let single = orDo(single1, single2);
+/** args = single "," args | single */
+let args1 = (x) => {
+    var ret = thenDo(thenDo(thenDo(toSome(x), single), tComma), args);
+    if (ret._tag == "Some") {
+        let retLength = ret.value.ast.length;
+        ret.value.ast = [[ret.value.ast[retLength - 3]].concat(ret.value.ast[retLength - 1])];
+        console.log("$$" + repr(ret.value.ast));
     }
-    ;
-    let float = bTerm(floatPattern, TokenType.FLO);
-    // operators
-    // +.
-    let floatAdd = bTerm((x) => thenDo(thenDo(x, match1Char("+")), match1Char(".")), TokenType.F_ADD);
-    // +.
-    let floatSub = bTerm((x) => thenDo(thenDo(x, match1Char("-")), match1Char(".")), TokenType.F_SUB);
-    // *.
-    let floatMul = bTerm((x) => thenDo(thenDo(x, match1Char("*")), match1Char(".")), TokenType.F_MUL);
-    // /.
-    let floatDiv = bTerm((x) => thenDo(thenDo(x, match1Char("/")), match1Char(".")), TokenType.F_DIV);
-    // ==
-    let eq = bTerm((x) => thenDo(thenDo(x, match1Char("=")), match1Char("=")), TokenType.EQ);
-    // >=
-    let ge = bTerm((x) => thenDo(thenDo(x, match1Char(">")), match1Char("=")), TokenType.GE);
-    // <=
-    let le = bTerm((x) => thenDo(thenDo(x, match1Char("<")), match1Char("=")), TokenType.LE);
-    // ->
-    let rightArrow = bTerm((x) => thenDo(thenDo(x, match1Char("-")), match1Char(">")), TokenType.R_ARROW);
-    /**
-     * unary operator : generating the pattern of basic unary operator
-     * @param char : uniry char for the operator
-     * @param token_type : the corresponding token_type
-     */
-    function unaryOp(char, token_type) {
-        return bTerm((x) => thenDo(x, match1Char(char)), token_type);
+    return ret;
+};
+let args2 = single;
+let args = orDo(args1, args2);
+/** callees = "(" args ")" | "(" ")" */
+let callees1 = circumfix((x) => thenDo(thenDo(thenDo(toSome(x), tLParen), args), tRParen), "callees1");
+let callees2 = (x) => {
+    let ret = thenDo(thenDo(toSome(x), tLParen), tRParen);
+    if (ret._tag == "Some") {
+        let new_ast = [[]];
+        ret.value.ast = new_ast;
+    }
+    return ret;
+};
+let callees = orDo(callees1, callees2);
+/** %apply R combinating token */
+let applyToken = {
+    text: "%apply",
+    type: tk.TokenType.ID,
+    col: 0,
+    ln: 0,
+};
+/** facAux = callees facAux |  callees */
+let facAux1 = (x) => {
+    var ret = thenDo(thenDo(toSome(x), callees), facAux);
+    if (ret._tag == "Some") {
+        console.log("1232345" + repr(tkTreeToSExp(ret.value.ast[ret.value.ast.length - 1])));
+        let last1 = ret.value.ast[ret.value.ast.length - 1];
+        let last2 = ret.value.ast[ret.value.ast.length - 2];
+        let b = [applyToken];
+        ret.value.ast = [b.concat([last2, last1])];
+        console.log("11111" + repr(tkTreeToSExp(ret.value.ast)));
     }
     ;
-    let intAdd = unaryOp('+', TokenType.I_ADD);
-    let intSub = unaryOp('-', TokenType.I_SUB);
-    let intMul = unaryOp('*', TokenType.I_MUL);
-    let intDiv = unaryOp('/', TokenType.I_DIV);
-    let lParen = unaryOp('(', TokenType.L_PAREN);
-    let rParen = unaryOp(')', TokenType.R_PAREN);
-    let lBracket = unaryOp('[', TokenType.L_BRACK);
-    let rBracket = unaryOp(']', TokenType.R_BRACK);
-    let lBrace = unaryOp('{', TokenType.L_BRACE);
-    let rBrace = unaryOp('}', TokenType.R_BRACE);
-    let comma = unaryOp(',', TokenType.COMMA);
-    let dot = unaryOp('.', TokenType.DOT);
-    let colon = unaryOp(':', TokenType.COLON);
-    let semicolon = unaryOp(';', TokenType.SEMI_C);
-    let at = unaryOp('@', TokenType.AT);
-    let hash = unaryOp('#', TokenType.HASH);
-    let set = unaryOp('=', TokenType.SET);
-    let greaterthan = unaryOp('>', TokenType.GT);
-    let lessthan = unaryOp('<', TokenType.LE);
-    let term = (token_list, x) => {
-        var ln = 1;
-        var col = 0;
-        var old_x = x;
-        let term_list = [float, newline, space, integer, str, id,
-            floatAdd, floatSub, floatMul, floatDiv,
-            intAdd, intSub, intMul, intDiv,
-            eq, ge, le, rightArrow,
-            lParen, rParen, lBracket, rBracket, lBrace, rBrace,
-            comma, dot, colon, semicolon, at, hash,
-            set, greaterthan, lessthan];
-        let term_aux = term_list.reduce((x, y) => orDo(x, y));
-        var new_x = thenDo(old_x, term_aux);
-        while (new_x._tag != "None") {
-            if (new_x.value.matched_type != TokenType.NL) {
-                col += new_x.value.matched.length;
-                token_list.push({ text: new_x.value.matched,
-                    type: new_x.value.matched_type,
-                    ln: ln,
-                    col: col });
+    return ret;
+};
+let facAux2 = callees;
+let facAux = orDo(facAux1, facAux2);
+/** fac = single facAux | single
+ * Issue1 to be fixed.
+ */
+let fac1 = (x) => {
+    var ret = thenDo(thenDo(toSome(x), single), facAux);
+    if (ret._tag == "Some") {
+        console.log("777" + repr(tkTreeToSExp(ret.value.ast)));
+        ret.value.ast = [applyToken, ret.value.ast[ret.value.ast.length - 2],
+            ret.value.ast[ret.value.ast.length - 1]];
+        ret.value.ast;
+        rearrangeTree(ret.value.ast);
+        console.log("888" + repr(tkTreeToSExp(ret.value.ast)));
+    }
+    return ret;
+};
+let fac2 = single;
+let fac = orDo(fac1, fac2);
+/**
+ * rearrangeTree : for applyToken subtree from right-combination to
+ * left-combination
+ * @input x a ast
+ * @return another ast
+ */
+function rearrangeTree(x) {
+    if (x !== undefined) {
+        for (var i = 1; i < x.length; i++) {
+            rearrangeTree(x[i]);
+        }
+        console.log("@@" + repr(x[0]));
+        if (x[0] == applyToken) {
+            if (Array.isArray(x[2]) && x[2][0] == applyToken) {
+                let rl = rearrangeTree(x[2][1]);
+                let rr = rearrangeTree(x[2][2]);
+                let l = rearrangeTree(x[1]);
+                x[0] = applyToken;
+                x[1] = [applyToken, l, rl];
+                x[2] = rr;
+                console.log("@@==" + repr(x));
+                return x;
             }
             else {
-                col = 0;
-                ln += 1;
-                token_list.push({ text: new_x.value.matched,
-                    type: new_x.value.matched_type,
-                    ln: ln,
-                    col: col });
+                x[0] = applyToken;
+                x[1] = rearrangeTree(x[1]);
+                x[2] = rearrangeTree(x[2]);
+                console.log("@@==" + repr(x));
+                return x;
             }
-            old_x = toSome({ matched: "",
-                remained: new_x.value.remained });
-            new_x = thenDo(old_x, term_aux);
         }
-        if (old_x.value.remained.length) {
-            console.log(token_list);
-            throw new Error("the code can't be tokenized is near Ln. " + ln + ", Col." + col
-                + ", starting with " + old_x.value.remained.substring(0, 10));
-        }
-        return token_list;
-    };
-    console.log(term([], input_matchee_pair));
-    // TODO: id, string, space, basic operator, 3 marks: @, {, }.
+        return x;
+    }
+}
+/**
+ *
+ * term1 = fac (MUL | DIV) fac
+ */
+let term1 = midfix((x) => thenDo(thenDo(thenDo(toSome(x), fac), orDo(tMul, tDiv)), fac), "term1");
+/**
+ *
+ * term2 = int MUL int
+ */
+let term2 = fac;
+/**
+ * term = term1 | term2
+ */
+let term = orDo(term1, term2);
+/**
+ *
+ * expr1 = term ADD term
+ */
+let expr1 = midfix((x) => thenDo(thenDo(thenDo(toSome(x), term), orDo(tAdd, tSub)), term), "expr1");
+/**
+ * expr2 = term
+ */
+let expr2 = term;
+/**
+ * expr = expr1 | expr2
+ */
+let expr = orDo(expr1, expr2);
+let tokens = tk.tokenize("1");
+let tokens2 = tk.tokenize("1(2)");
+let tokens3 = tk.tokenize("1(2)(3)");
+let tokens4 = tk.tokenize("2()(4)(5,6)(7,8,9,10)");
+//let tokens = tk.tokenize("(4-(3/4))");
+//tk.tokenize(argv[2]);
+let tokensFiltered = tokens4.filter((x) => {
+    return (x.type != tk.TokenType.NL
+        && x.type != tk.TokenType.SP);
+});
+let beta = expr({
+    matched: [],
+    remained: tokensFiltered,
+    ast: []
+});
+if (beta._tag == "Some") {
+    beta.value.ast = rearrangeTree(beta.value.ast);
+    console.log(tkTreeToSExp(beta.value.ast));
 }
-exports.tokenize = tokenize;
+console.log("RESULT=" + repr(beta));