20230910 : add basic parser `CONST` rule, and add the grammar rule.

[uann] / src / index.js

diff --git a/src/index.js b/src/index.js
index fb887701725ab7261a7bda6b47b78fa15babc3a5..e18ebd5a1c4ff82a83542e067c0c39c7c233d41c 100644 (file)
--- a/src/index.js
+++ b/src/index.js
@@ -23,26 +23,32 @@ var __importStar = (this && this.__importStar) || function (mod) {
     return result;
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.match1token = void 0;
+exports.m1TType = void 0;
 var fs = require('fs');
+const node_process_1 = require("node:process");
 const tk = __importStar(require("./tokenize.js"));
-let b = tk.tokenize("2+2");
+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
+ * 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 t : the char to be test.
- * @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 match1token(t) {
+function m1TType(typ) {
     return (m) => {
         if (m.remained.length == 0) {
             return { _tag: "None" };
         }
-        const tokenToBeMatched = m.remained[0];
-        if (tokenToBeMatched === t) {
-            m.matched.push(tokenToBeMatched);
+        /**
+         * token to be matched
+         * */
+        const ttbm = m.remained[0];
+        if (ttbm.type == typ) {
+            m.matched.push(ttbm);
             return {
                 _tag: "Some", value: {
                     matched: m.matched,
@@ -55,7 +61,59 @@ function match1token(t) {
         }
     };
 }
-exports.match1token = match1token;
+exports.m1TType = m1TType;
 ;
-let c = tk.toSome(b);
-console.log(thenDo(c, match1token(tk.tokenize("+")[0])));
+let toSome = tk.toSome;
+let thenDo = tk.thenDo;
+let orDo = tk.orDo;
+node_process_1.argv.forEach((val, index) => {
+    console.log(`${index}=${val}`);
+});
+let commandInput = node_process_1.argv[2];
+let commandInputTokenized = tk.tokenize(commandInput);
+console.log(commandInputTokenized);
+/**
+ * matchee pair of commandInputTokenized
+ */
+let commandTPair = { matched: [],
+    remained: commandInputTokenized };
+let tInt = m1TType(tk.TokenType.INT);
+let tFlo = m1TType(tk.TokenType.FLO);
+let tStr = m1TType(tk.TokenType.STR);
+function tBool(x) {
+    let text = x.remained[0].text;
+    if (text == "true" || text == "false") {
+        return thenDo(toSome(x), m1TType(tk.TokenType.ID));
+    }
+    else {
+        return { _tag: "None" };
+    }
+}
+/**
+ * define the right hand side of a grammar
+ * eg. `LHS ::= a + b`
+ * @param process  the right hand side processing : eg. `a + b` in `LHS`
+ * @param arrange define the order (0 starting) of the elements of the result.
+ * ast. : eg. `a + c` is `1 0 2` `(+ a c)`
+ * @returns the processed ast.
+ */
+function gramRHS(process, arrange) {
+    return (m) => {
+        let result = process(m);
+        console.log(`result ${result}`);
+        if (result._tag == "None") {
+            return result;
+        }
+        else {
+            let matched = result.value.matched;
+            let return_array = Array(arrange.length);
+            arrange.forEach((val, index) => {
+                return_array[arrange[index]] = matched[index];
+            });
+            return return_array;
+        }
+    };
+}
+var constParser = gramRHS((x) => { return thenDo(toSome(x), orDo(orDo(orDo(tInt, tFlo), tStr), tBool)); }, [0]);
+let tree = constParser(commandTPair);
+console.log(util.inspect(tree, { showHidden: true, depth: null }));