X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.js;h=0e3686ca2732f5843159c62a956aa15071329fda;hb=5f0943539e27b3e0d08e70559ea39017e6df330e;hp=23320ac6471bd64cf15a6771802a5234bf85f354;hpb=c236ca23a513d0a456add8c98401af10cfbdb295;p=clo diff --git a/src/index.js b/src/index.js index 23320ac..0e3686c 100644 --- a/src/index.js +++ b/src/index.js @@ -1,230 +1,217 @@ "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.tokenize = exports.zeroOrOnceDo = exports.notDo = exports.zeroOrMoreDo = exports.orDo = exports.thenDo = exports.charToCodepoint = exports.matchRange = exports.matchAny = 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")); +/** + * debug reprensenting + */ +let repr = (x) => { return util.inspect(x, { depth: null }); }; /** - * wrap a x in a `Some(T)` - * @param x : variable to be wrapped. - * @returns wrapped `x`. + * 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 toSome(x) { - return { _tag: "Some", value: x }; +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."); + } } /** * @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) => { if (m.remained.length == 0) { return { _tag: "None" }; } - const charToBeMatched = m.remained[0]; - if (charToBeMatched === c) { - 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) { + 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.match1Char = match1Char; +exports.m1TType = m1TType; ; /** - * - * @param m : the `MatcheePair` to be consumed. - * @returns if the length of `m.remained` >= 1; consumes the matchee by 1 char and wraps it in `Some`, - * otherwise, returns `None`. + * type int */ -function matchAny(m) { - if (m.remained.length >= 1) { - return { _tag: "Some", value: { - matched: m.matched + m.remained[0], - remained: m.remained.substring(1) - } }; +let tInt = m1TType(tk.TokenType.INT); +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); +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 { _tag: "None" }; + var a = f(m.value); + if (a._tag == "Some") { + a.value.ast = concat(m.value.ast, a.value.ast); + } + return a; } } -exports.matchAny = matchAny; /** - * @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`. + * like `f1 | f2` in regex + * @param f1 the first tried function + * @param f2 the second tried function + * @returns wrapped result */ -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) => { - if (m.remained.length < 1) { - return { _tag: "None" }; - } - 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) - } }; +function orDo(f1, f2) { + return (x) => { + let res1 = f1(x); + if (res1._tag == "Some") { + return res1; } else { - return { _tag: "None" }; + let res2 = f2(x); + return res2; } }; } -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`. + * aux function for midfix operator + * @param f function + * @param signal the rule name + * @returns */ -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 midfix = (f, signal) => (x) => { + var a = f(x); + if (a._tag == "Some") { + 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)); } - else { - return s.charCodeAt(0); + 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]; + console.log("AST====" + repr(a.value.ast)); + let ast_middle = [inner]; + let new_ast = [ast_middle]; + a.value.ast = new_ast; + console.log("+" + signal + "+" + repr(a)); } -} -exports.charToCodepoint = charToCodepoint; + return a; +}; +/** fac1 = "(" expr ")" */ +let fac1 = circumfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), tLParen), expr), tRParen), "fac1"); +let fac2 = tInt; +let fac = orDo(fac1, fac2); /** - * @description thendo(input, f, ...) like - * a ==> f - * @param input: the wrapped input. - * @param f: the function to be applied. * - * @returns:the applied wrapped result `MatcheePair`. + * term1 = fac (MUL | DIV) fac */ -function thenDo(input, f) { - if (input._tag == "None") { - return input; - } - else { - let inner = input.value; - return f(inner); - } -} -exports.thenDo = thenDo; +let term1 = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), fac), orDo(tMul, tDiv)), fac), "term1"); /** - * @description "or", like the regex `( f1 | f2 )` . - * It returns a function `f` of which the argument is`x`. - * if `f1(x)` is None, then `f` returns `f2(x)`. Otherwise, - * `F` returns `f1(x)`. - * @param f1 : 1st function to be compared - * @param f2 : 2nd function to be compared - * @returns:the combined function + * + * term2 = int MUL int */ -function orDo(f1, f2) { - return (x) => { - let f1x = (f1(x)); - { - if (f1x._tag == "None") { - return f2(x); - } - else { - return f1x; - } - } - }; -} -exports.orDo = orDo; +let term2 = fac; /** -* @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 zeroOrMoreDo(f) { - return (x) => { - var wrapped_old_x = { _tag: "Some", value: x }; - var wrapped_new_x = wrapped_old_x; - while (wrapped_new_x._tag != "None") { - wrapped_old_x = wrapped_new_x; - wrapped_new_x = thenDo(wrapped_old_x, f); - } - ; - return wrapped_old_x; - }; -} -exports.zeroOrMoreDo = zeroOrMoreDo; + * term = term1 | term2 + */ +let term = orDo(term1, term2); /** -* @description Not. like the `^` inside regex of [^f]. -* returns a function `F(x)` such that if `f(x)` is `None`, -* returns the x consuming a char; if `f(x)` is not None, F(x) -* returns `None`. -* @param f: the function forbidden to be matched. -* @returns: combined function `F`. -*/ -function notDo(f) { - return (x) => { - let wrapped_x = { - _tag: "Some", - value: x - }; - let f_x = thenDo(wrapped_x, f); - if (f_x._tag != "None") { - return { _tag: "None" }; - } - else { - return thenDo(wrapped_x, matchAny); - } - }; -} -exports.notDo = notDo; + * + * expr1 = term ADD term + */ +let expr1 = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), term), orDo(tAdd, tSub)), term), "expr1"); /** - * if `x` is matched by `f` once, returns `f(x)`. Otherwise, - * returns x - * similar to `?` in regex `f?`. - * @param f : the function to be matched - * @returns return wrapped f(x) + * expr2 = term */ -function zeroOrOnceDo(f) { - return (x) => { - var wrapped_old_x = { _tag: "Some", value: x }; - var wrapped_new_x = thenDo(wrapped_old_x, f); - if (wrapped_new_x._tag != "None") { - return wrapped_new_x; - } - else { - return wrapped_old_x; - } - }; -} -exports.zeroOrOnceDo = zeroOrOnceDo; -function tokenize(input) { - var input_matchee_pair = toSome({ matched: "", - remained: input }); - // integer = ([+]|[-])\d\d? - let integer = (x) => { - let wrapped_x = toSome(x); - let plusMinus = orDo(match1Char('+'), match1Char('-')); // ([+]|[-]) - let d = matchRange('0', '9'); // \d - return thenDo(thenDo(thenDo(wrapped_x, zeroOrOnceDo(plusMinus)), d), zeroOrMoreDo(d)); - }; - console.log(input + ", result: "); - console.log(thenDo(input_matchee_pair, integer)); - // TODO: id, string, space, basic operator, 3 marks: @, {, }. -} -exports.tokenize = tokenize; -tokenize("+123"); -tokenize("123"); -tokenize("-123"); -tokenize(" 123"); -tokenize("c123"); +let expr2 = term; +/** + * expr = expr1 | expr2 + */ +let expr = orDo(expr1, expr2); +let tokens = tk.tokenize("(4-(3/4))"); //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(beta));