X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.js;h=38161302e9cc3f09f27c20b51adb4ec8800887ee;hb=fed01e9044149985b3df74a9225ce68805b8f478;hp=712af45015c8dbd4747f9df53f1506724ca8effd;hpb=4cfa9c7cb47795674b6f2c2f2d0f63fe24100c49;p=clo

diff --git a/src/index.js b/src/index.js
index 712af45..3816130 100644
--- a/src/index.js
+++ b/src/index.js
@@ -1,88 +1,186 @@
 "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;
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.thenDo = exports.charToCodepoint = exports.matchRange = exports.match1Char = void 0;
+exports.matchAny = exports.tkTreeToSExp = void 0;
 var fs = require('fs');
+const js_tokens_1 = __importDefault(require("js-tokens"));
+const util = __importStar(require("util"));
 /**
- * @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`.
+ *
+ * # REPRESENTATION
  */
-function match1Char(c) {
-    return (m) => {
-        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" };
-        }
-    };
-}
-exports.match1Char = match1Char;
-;
 /**
- * @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
- * 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`.
+ * convert a `tkTree` AST to S-expr string
+ * @param t the `tkTree`
+ * @returns S-expr String
  */
-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 tkTreeToSExp(t) {
+    var str = "";
+    if (Array.isArray(t)) {
+        let strArray = t.map((x) => tkTreeToSExp(x));
+        str = "(" + strArray.join(" ") + ")";
     }
-    return (m) => {
-        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)
-                } };
+    else {
+        if (t === undefined) {
+            str = "%undefined";
         }
         else {
-            return { _tag: "None" };
+            str = t.value;
         }
-    };
+    }
+    return str;
+}
+exports.tkTreeToSExp = tkTreeToSExp;
+/**inspect the inner of the representation. */
+let repr = (x) => { return util.inspect(x, { depth: null }); };
+/**
+ *
+ * # PARSER UNITS
+ */
+function toSome(x) {
+    return { _tag: "Some", value: x };
 }
-exports.matchRange = matchRange;
-;
 /**
- * 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`.
+ * like `m ==> f` in ocaml
+ * @param m matchee wrapped
+ * @param f matching function
+ * @returns wrapped result
  */
-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.`);
+function thenDo(m, f) {
+    if (m._tag == "None") {
+        return m;
     }
     else {
-        return s.charCodeAt(0);
+        var a = f(m.value);
+        if (a._tag == "Some") {
+            a.value.ast = m.value.ast.concat(a.value.ast);
+        }
+        return a;
     }
 }
-exports.charToCodepoint = charToCodepoint;
 /**
- *  @description thendo(input, f, ...) like
- * a ==> f
+ *
+ * @param m : the `TokenPair` 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 thenDo(input, f) {
-    if (input._tag == "None") {
-        return input;
+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 {
-        let inner = input.value;
-        return f(inner);
+        return { _tag: "None" };
     }
 }
-exports.thenDo = thenDo;
+exports.matchAny = matchAny;
+/**
+ * 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 res1 = f1(x);
+        if (res1._tag == "Some") {
+            return res1;
+        }
+        else {
+            let res2 = f2(x);
+            return res2;
+        }
+    };
+}
+/**
+ * like regex [^c]
+ * @param f input token function. one token only.
+ * @returns combined finction
+ */
+function notDo(f) {
+    return (x) => {
+        let res1 = f(x);
+        if (res1._tag == "Some") {
+            return { _tag: "None" };
+        }
+        else {
+            let res2 = matchAny(x);
+            return res2;
+        }
+    };
+}
+function matchToken(typeName, value) {
+    return (t) => {
+        let headToken = t.remained[0];
+        if (headToken.type != typeName) {
+            return { _tag: "None" };
+        }
+        else {
+            if (value === undefined || value == headToken.value) {
+                let newTokenPair = {
+                    matched: t.matched.concat(headToken),
+                    remained: t.remained.slice(1),
+                    ast: [headToken]
+                };
+                return { _tag: "Some", value: newTokenPair };
+            }
+            else {
+                return { _tag: "None" };
+            }
+        }
+        ;
+    };
+}
+;
+/**
+ *
+ * # TEST
+ */
+const tokens = Array.from((0, js_tokens_1.default)(`import; foo from\t 'bar';
+import * as util  from 'util';
+
+
+花非花，霧\\{非霧 。{{foo();}}下
+一句`));
+console.log("RESULT=" + repr(tokens));
+var mainTokenPair = {
+    matched: [],
+    remained: tokens,
+    ast: []
+};
+let a = thenDo(thenDo(toSome(mainTokenPair), matchToken('IdentifierName')), notDo(matchToken('Punctuator', ';')));
+console.log("RESULT=" + repr(a));
+if (a._tag == "Some") {
+    console.log("SEXP=" + tkTreeToSExp(a.value.ast));
+}