"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.thenDo = exports.charToCodepoint = exports.matchRange = exports.match1Char = void 0;
+exports.m1TType = void 0;
var fs = require('fs');
+const node_process_1 = require("node:process");
+const tk = __importStar(require("./tokenize.js"));
+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 c : 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 match1Char(c) {
+function m1TType(typ) {
return (m) => {
- const charToBeMatched = m.remained[0];
- if (charToBeMatched === c) {
- return { _tag: "Some", value: {
- matched: m.matched + charToBeMatched,
- remained: m.remained.substring(1)
- } };
- }
- else {
+ if (m.remained.length == 0) {
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`.
- */
-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 + "`)");
- }
- 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)
- } };
+ /**
+ * token to be matched
+ * */
+ const ttbm = m.remained[0];
+ if (ttbm.type == typ) {
+ m.matched.push(ttbm);
+ return {
+ _tag: "Some", value: {
+ matched: m.matched,
+ remained: m.remained.slice(1)
+ }
+ };
}
else {
return { _tag: "None" };
}
};
}
-exports.matchRange = matchRange;
+exports.m1TType = m1TType;
;
+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);
/**
- * 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`.
+ * matchee pair of commandInputTokenized
*/
-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.`);
+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 s.charCodeAt(0);
+ return { _tag: "None" };
}
}
-exports.charToCodepoint = charToCodepoint;
/**
- * @description thendo(input, f, ...) like
- * a ==> f
+ * 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 thenDo(input, f) {
- if (input._tag == "None") {
- return input;
- }
- else {
- let inner = input.value;
- return f(inner);
- }
+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;
+ }
+ };
}
-exports.thenDo = thenDo;
+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 }));