-/**
- * like `f1 | f2` in regex
- * @param f1 the first tried function
- * @param f2 the second tried function
- * @returns wrapped result
- */
-function orDo(f1 : Function, f2 : Function){
- return (x : TokenMatcheePair) =>{
- let res1 : tk.Maybe<TokenMatcheePair> = f1(x);
- if (res1._tag == "Some"){
- return res1;
- }else{
- let res2 : tk.Maybe<TokenMatcheePair> = f2(x);
- return res2;
- }
- }
-}
-
-
-/**
- *
- * @param m : the `MatcheePair` to be consumed.
- * @returns if the length of `m.remained` >= 1; consumes the matchee by 1 token
- * and wraps it in `Some`,
- * otherwise, returns `None`.
- */
-export function matchAny(m: TokenMatcheePair): tk.Maybe<TokenMatcheePair> {
- if (m.remained.length >= 1) {
- return {
- _tag: "Some", value: {
- matched: m.matched.concat(m.remained[0]),
- remained: m.remained.slice(1),
- ast : [m.remained[0]],
- }
- };
- } else {
- return { _tag: "None" };
- }
-}
-
-/**
- * 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
-*/
-export function OnceOrMoreDo(f: Function): (x: TokenMatcheePair) =>
- tk.Maybe<TokenMatcheePair> {
- return (x) => {
- var wrappedOldX: tk.Maybe<TokenMatcheePair> = { _tag: "Some", value: x };
- var wrappedNewX: tk.Maybe<TokenMatcheePair> = 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; };
-}
-
-/**
- * aux function for midfix operator
- * @param f function
- * @param signal the rule name
- * @returns
- */
-let midfix = (f : Function, signal? : string) => (x : TokenMatcheePair)=>{
- var a = f(x);
- if (a._tag == "Some"){
- let ast_tail : tkTree[] = 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 : Function, signal? : string) => (x : TokenMatcheePair)=>{
- var a : tk.Maybe<TokenMatcheePair> = f(x);
- if (a._tag == "Some"){
- console.log("$$$"+repr(a.value.ast));
- let inner = a.value.ast[a.value.ast.length-2];
- var ast_middle : tkTree[];
- // the list should not be (%list) (%apply) (%lambda) etc.
- if (Array.isArray(inner)){
- if ('text' in inner[0] && (inner[0].text.slice(0,1) != "%")){
- ast_middle = inner;
- }
- else{
- ast_middle = [inner];
- }
- }
- else{
- ast_middle = [inner];
- }
- let new_ast = [ast_middle];
- a.value.ast = new_ast;
- }
- return a;
-}
-
-/** single1 = tInt | "(" expr ")"*/
-let single1 = circumfix((x : TokenMatcheePair) =>
- thenDo(thenDo(thenDo(toSome(x), tLParen), expr), tRParen), "fac1");
-let single2= tInt;
-let single = orDo(single1, single2);
-
-/** args = single "," args | single */
-let args1 = (x: TokenMatcheePair)=>{
- var ret = thenDo(thenDo(thenDo(toSome(x), single), tComma), args);
- if (ret._tag == "Some"){
- let retLength = ret.value.ast.length;
- ret.value.ast = [[ret.value.ast[retLength-3]].concat(ret.value.ast[retLength-1])];
- console.log("$$"+repr(ret.value.ast));
- }
- return ret;
-};
-
-let args2 = single;
-
-let args = orDo(args1, args2);
-
-
-/** callees = "(" args ")" | "(" ")" */
-
-
-let callees1 = circumfix((x : TokenMatcheePair) =>
- thenDo(thenDo(thenDo(toSome(x), tLParen), args), tRParen), "callees1");
-let callees2 = (x: TokenMatcheePair)=>{
- let ret = thenDo(thenDo(toSome(x), tLParen), tRParen);
- if (ret._tag == "Some"){
- let new_ast : tkTree[] = [[]];
- 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: TokenMatcheePair)=>{
- var ret = thenDo(thenDo(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 : tkTree[] = [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: TokenMatcheePair)=>{
- var ret = thenDo(thenDo(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: any) : any {
-
- 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));