X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.js;h=bd62a482ca9328e21b9ae296d7f4ba8554582df3;hb=f801ef14fc25ae122aaef4aede639ddb9b37006a;hp=712af45015c8dbd4747f9df53f1506724ca8effd;hpb=13c9e7026b3a5ba274ef046db3311b76aaaac244;p=clo diff --git a/src/index.js b/src/index.js index 712af45..bd62a48 100644 --- a/src/index.js +++ b/src/index.js @@ -1,88 +1,198 @@ "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 - * in `Some`. Otherwise, it returns `None`. - * * @param c : the char to be test. - * @returns the updated `MatchedPair` wrapped in `Some(x)` or `None`. + * debug reprensenting */ -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" }; - } - }; +let repr = (x) => { return util.inspect(x, { depth: null }); }; +/** + * 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 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; -; /** * @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) => { - 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) - } }; + if (m.remained.length == 0) { + return { _tag: "None" }; + } + /** + * 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.`); +let tInt = m1TType(tk.TokenType.INT); +let tAdd = m1TType(tk.TokenType.I_ADD); +let tMul = m1TType(tk.TokenType.I_MUL); +node_process_1.argv.forEach((val, index) => { + console.log(`${index}=${val}`); +}); +/** + * like `m ==> f` in ocaml + * @param m matchee wrapped + * @param f matching function + * @returns wrapped result + */ +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 = concat(m.value.ast, a.value.ast); + } + return a; } } -exports.charToCodepoint = charToCodepoint; /** - * @description thendo(input, f, ...) like - * a ==> f + * like `f1 | f2` in regex + * @param f1 the first tried function + * @param f2 the second tried function + * @returns wrapped result */ -function thenDo(input, f) { - if (input._tag == "None") { - return input; - } - else { - let inner = input.value; - return f(inner); - } +function orDo(f1, f2) { + return (x) => { + let res1 = f1(x); + if (res1._tag == "Some") { + return res1; + } + else { + let res2 = f2(x); + return res2; + } + }; } -exports.thenDo = thenDo; +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)); + } + return a; +}; +/** + * + * fac1 = int MUL int + */ +//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; +}; +/** + * + * fac2 = int MUL int + */ +let fac2 = tInt; +/** + * fac = fac1 | fac2 + */ +let fac = orDo(fac1, fac2); +/** + * + * expr1 = fac ADD fac + */ +let expr1 = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), fac), tAdd), fac), "expr1"); +/** + * expr2 = fac + */ +let expr2 = fac; +/** + * expr = expr1 | expr2 + */ +let expr = orDo(expr1, expr2); +let tokens = tk.tokenize("2+3"); //tk.tokenize(argv[2]); +let tokensFiltered = tokens.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));