-exports.matchAny = matchAny;
-/**
- * Danger : Maybe it's not enough to work.
-* @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 OnceOrMoreDo(f) {
- return (x) => {
- var wrappedOldX = { _tag: "Some", value: x };
- var wrappedNewX = wrappedOldX;
- var counter = -1;
- while (wrappedNewX._tag != "None") {
- wrappedOldX = wrappedNewX;
- wrappedNewX = thenDo(wrappedOldX, f);
- counter += 1;
- }
- ;
- if (counter <= 0) {
- return { _tag: "None" };
- }
- let ast = wrappedOldX.value.ast;
- wrappedOldX.value.ast = ast.slice(ast.length - counter);
- console.log(repr(wrappedOldX.value.ast));
- return wrappedOldX;
- };
-}
-exports.OnceOrMoreDo = OnceOrMoreDo;
-/**
- * aux function for midfix operator
- * @param f function
- * @param signal the rule name
- * @returns
- */
-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));
- }
- 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];
- let ast_middle = [inner];
- let new_ast = [ast_middle];
- a.value.ast = new_ast;
- }
- return a;
-};
-/** single1 = tInt | "(" expr ")"*/
-let single1 = circumfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), tLParen), expr), tRParen), "fac1");
-let single2 = tInt;
-let single = orDo(single1, single2);
-/** func = single | single "(" single ")"
- * i.e.
- *
- * func = single | func_aux ( int )
- *
-*/
-/** callees = "(" args ")" | "(" ")" */
-let callees1 = circumfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), tLParen), tInt), tRParen), "callees1");
-let callees2 = (x) => {
- let ret = thenDo(thenDo(tk.toSome(x), tLParen), tRParen);
- if (ret._tag == "Some") {
- let new_ast = [[]];
- ret.value.ast = new_ast;
- }
- return ret;
-};
-let callees = orDo(callees1, callees2);
-/** %apply R combinating token */
-let applyToken = {
- text: "%apply",
- type: tk.TokenType.ID,
- col: 0,
- ln: 0,
-};
-/** facAux = callees facAux | callees */
-let facAux1 = (x) => {
- var ret = thenDo(thenDo(tk.toSome(x), callees), facAux);
- if (ret._tag == "Some") {
- console.log("1232345" + repr(tkTreeToSExp(ret.value.ast[ret.value.ast.length - 1])));
- let last1 = ret.value.ast[ret.value.ast.length - 1];
- let last2 = ret.value.ast[ret.value.ast.length - 2];
- let b = [applyToken];
- ret.value.ast = [b.concat([last2, last1])];
- console.log("11111" + repr(tkTreeToSExp(ret.value.ast)));
- }
- ;
- return ret;
-};
-let facAux2 = callees;
-let facAux = orDo(facAux1, facAux2);
-/** fac = single facAux | single
- * Issue1 to be fixed.
- */
-let fac1 = (x) => {
- var ret = thenDo(thenDo(tk.toSome(x), single), facAux);
- if (ret._tag == "Some") {
- console.log("777" + repr(tkTreeToSExp(ret.value.ast)));
- ret.value.ast = [applyToken, ret.value.ast[ret.value.ast.length - 2],
- ret.value.ast[ret.value.ast.length - 1]];
- ret.value.ast;
- rearrangeTree(ret.value.ast);
- console.log("888" + repr(tkTreeToSExp(ret.value.ast)));
- }
- return ret;
-};
-let fac2 = single;
-let fac = orDo(fac1, fac2);
-/**
- * rearrangeTree : for applyToken subtree from right-combination to
- * left-combination
- * @input x a ast
- * @return another ast
- */
-function rearrangeTree(x) {
- if (x !== undefined) {
- for (var i = 1; i < x.length; i++) {
- rearrangeTree(x[i]);
- }
- console.log("@@" + repr(x[0]));
- if (x[0] == applyToken) {
- if (Array.isArray(x[2]) && x[2][0] == applyToken) {
- let rl = rearrangeTree(x[2][1]);
- let rr = rearrangeTree(x[2][2]);
- let l = rearrangeTree(x[1]);
- x[0] = applyToken;
- x[1] = [applyToken, l, rl];
- x[2] = rr;
- console.log("@@==" + repr(x));
- return x;
- }
- else {
- x[0] = applyToken;
- x[1] = rearrangeTree(x[1]);
- x[2] = rearrangeTree(x[2]);
- console.log("@@==" + repr(x));
- return x;
- }
- }
- return x;
- }
-}
-/**
- *
- * term1 = fac (MUL | DIV) fac
- */
-let term1 = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), fac), orDo(tMul, tDiv)), fac), "term1");
-/**
- *
- * term2 = int MUL int
- */
-let term2 = fac;
-/**
- * term = term1 | term2
- */
-let term = orDo(term1, term2);
-/**
- *
- * expr1 = term ADD term
- */
-let expr1 = midfix((x) => thenDo(thenDo(thenDo(tk.toSome(x), term), orDo(tAdd, tSub)), term), "expr1");
-/**
- * expr2 = term
- */
-let expr2 = term;
-/**
- * expr = expr1 | expr2
- */
-let expr = orDo(expr1, expr2);
-let tokens = tk.tokenize("1");
-let tokens2 = tk.tokenize("1(2)");
-let tokens3 = tk.tokenize("1(2)(3)");
-let tokens4 = tk.tokenize("2()");
-//let tokens = tk.tokenize("(4-(3/4))");
-//tk.tokenize(argv[2]);
-let tokensFiltered = tokens4.filter((x) => {
- return (x.type != tk.TokenType.NL
- && x.type != tk.TokenType.SP);
-});
-let beta = expr({
- matched: [],
- remained: tokensFiltered,
- ast: []
-});
-if (beta._tag == "Some") {
- beta.value.ast = rearrangeTree(beta.value.ast);
- console.log(tkTreeToSExp(beta.value.ast));
-}
-console.log("RESULT=" + repr(beta));