X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.js;h=71b98d97f49e59efd1eb9a667b6f0afa9c595911;hb=3441b825eb0f2be5ea74227fb1eaa90df236e563;hp=bd62a482ca9328e21b9ae296d7f4ba8554582df3;hpb=f801ef14fc25ae122aaef4aede639ddb9b37006a;p=clo

diff --git a/src/index.js b/src/index.js
index bd62a48..71b98d9 100644
--- a/src/index.js
+++ b/src/index.js
@@ -23,7 +23,7 @@ var __importStar = (this && this.__importStar) || function (mod) {
     return result;
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.m1TType = 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"));
@@ -54,6 +54,28 @@ function slice(x, index, end) {
         throw new Error("the tkTree can't be concated, because it's not an array.");
     }
 }
+/**
+ * convert a `tkTree` AST to S-expr string
+ * @param t the `tkTree`
+ * @returns S-expr String
+ */
+function tkTreeToSExp(t) {
+    var str = "";
+    if (Array.isArray(t)) {
+        let strArray = t.map((x) => tkTreeToSExp(x));
+        str = "(" + strArray.join(" ") + ")";
+    }
+    else {
+        if (t === undefined) {
+            str = "%undefined";
+        }
+        else {
+            str = t.text;
+        }
+    }
+    return str;
+}
+exports.tkTreeToSExp = tkTreeToSExp;
 /**
  * @description
  * match one token type.
@@ -95,8 +117,14 @@ exports.m1TType = m1TType;
  * type int
  */
 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 toSome = tk.toSome;
 node_process_1.argv.forEach((val, index) => {
     console.log(`${index}=${val}`);
 });
@@ -136,63 +164,221 @@ function orDo(f1, f2) {
         }
     };
 }
+/**
+ *
+ * @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 OnceOrMoreDo(f) {
+    return (x) => {
+        var wrappedOldX = { _tag: "Some", value: x };
+        var wrappedNewX = wrappedOldX;
+        var counter = -1;
+        while (wrappedNewX._tag != "None") {
+            wrappedOldX = wrappedNewX;
+            wrappedNewX = thenDo(wrappedOldX, f);
+            counter += 1;
+        }
+        ;
+        if (counter <= 0) {
+            return { _tag: "None" };
+        }
+        let ast = wrappedOldX.value.ast;
+        wrappedOldX.value.ast = ast.slice(ast.length - counter);
+        console.log(repr(wrappedOldX.value.ast));
+        return wrappedOldX;
+    };
+}
+exports.OnceOrMoreDo = OnceOrMoreDo;
+/**
+ * aux function for midfix operator
+ * @param f function
+ * @param signal the rule name
+ * @returns
+ */
 let midfix = (f, signal) => (x) => {
     var a = f(x);
     if (a._tag == "Some") {
-        let ast_head = slice(a.value.ast, 0, a.value.ast.length - 3);
         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));
+        // console.log("+"+signal+"+"+repr(a));
     }
     return a;
 };
-/**
+let circumfix = (f, signal) => (x) => {
+    var a = f(x);
+    if (a._tag == "Some") {
+        let inner = a.value.ast[a.value.ast.length - 2];
+        let ast_middle = [inner];
+        let new_ast = [ast_middle];
+        a.value.ast = new_ast;
+    }
+    return a;
+};
+/** single1 = tInt | "(" expr ")"*/
+let single1 = circumfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), tLParen), expr), tRParen), "fac1");
+let single2 = tInt;
+let single = orDo(single1, single2);
+/** func = single | single "(" single ")"
+ * i.e.
  *
- * fac1 = int MUL int
+ * func = single |  func_aux ( int )
+ *
+*/
+/** callees = "(" args ")" | "(" ")" */
+let callees1 = circumfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), tLParen), tInt), tRParen), "callees1");
+let callees2 = (x) => {
+    let ret = thenDo(thenDo(tk.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(tk.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)));
+    }
+    ;
+    return ret;
+};
+let facAux2 = callees;
+let facAux = orDo(facAux1, facAux2);
+/** fac = single facAux | single
+ * Issue1 to be fixed.
  */
-//let fac1 = midfix((x : TokenMatcheePair)=>
-//            thenDo(thenDo(thenDo(tk.toSome(x), tInt), tMul), tInt));
 let fac1 = (x) => {
-    let a = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), tInt), tMul), tInt), "fac1")(x);
-    return a;
+    var ret = thenDo(thenDo(tk.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 {
+                x[0] = applyToken;
+                x[1] = rearrangeTree(x[1]);
+                x[2] = rearrangeTree(x[2]);
+                console.log("@@==" + repr(x));
+                return x;
+            }
+        }
+        return x;
+    }
+}
 /**
  *
- * fac2 = int MUL int
+ * term1 = fac (MUL | DIV) fac
  */
-let fac2 = tInt;
+let term1 = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), fac), orDo(tMul, tDiv)), fac), "term1");
 /**
- * fac = fac1 | fac2
+ *
+ * term2 = int MUL int
  */
-let fac = orDo(fac1, fac2);
+let term2 = fac;
+/**
+ * term = term1 | term2
+ */
+let term = orDo(term1, term2);
 /**
  *
- * expr1 = fac ADD fac
+ * expr1 = term ADD term
  */
-let expr1 = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), fac), tAdd), fac), "expr1");
+let expr1 = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), term), orDo(tAdd, tSub)), term), "expr1");
 /**
- * expr2 = fac
+ * expr2 = term
  */
-let expr2 = fac;
+let expr2 = term;
 /**
  * expr = expr1 | expr2
  */
 let expr = orDo(expr1, expr2);
-let tokens = tk.tokenize("2+3"); //tk.tokenize(argv[2]);
-let tokensFiltered = tokens.filter((x) => {
+let tokens = tk.tokenize("1");
+let tokens2 = tk.tokenize("1(2)");
+let tokens3 = tk.tokenize("1(2)(3)");
+let tokens4 = tk.tokenize("2()");
+//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 wrappedTokens = tk.toSome({
-    matched: [],
-    remained: tokensFiltered,
-    ast: []
-});
 let beta = expr({
     matched: [],
     remained: tokensFiltered,
     ast: []
 });
-console.log(repr(wrappedTokens));
-console.log(repr(beta));
+if (beta._tag == "Some") {
+    beta.value.ast = rearrangeTree(beta.value.ast);
+    console.log(tkTreeToSExp(beta.value.ast));
+}
+console.log("RESULT=" + repr(beta));