import * as tk from './tokenize.js';
import * as util from 'util';
import { drawEllipsePath, reduceRotation } from 'pdf-lib';
-import { isTypedArray } from 'node:util/types';
+import { isAnyArrayBuffer, isTypedArray } from 'node:util/types';
import { error } from 'node:console';
+import { isUndefined } from 'node:util';
/**
* debug reprensenting
/**
* TokenMatcheePair for tokens' parser combinator
+ *
* matched: the matched (now and before) tokens
+ *
* remained: tokens to be matched
+ *
* ast: abstract syntax tree
*/
export interface TokenMatcheePair {
ast : tkTree[]
}
+/**
+ * convert a `tkTree` AST to S-expr string
+ * @param t the `tkTree`
+ * @returns S-expr String
+ */
+export function tkTreeToSExp(t: tkTree): string{
+ var str = "";
+
+ if (Array.isArray(t)){
+ let strArray = t.map((x)=>tkTreeToSExp(x));
+ str = "(" + strArray.join(" ") + ")";
+ }else{
+ if (t=== undefined){
+ str = "%undefined"
+ }else{
+ str = t.text;
+ }
+ }
+
+ return str;
+}
+
/**
* @description
* match one token type.
* type int
*/
let tInt = m1TType(tk.TokenType.INT);
+let tId = m1TType(tk.TokenType.ID);
+
+
let tAdd = m1TType(tk.TokenType.I_ADD);
let tSub = m1TType(tk.TokenType.I_SUB);
let tMul = m1TType(tk.TokenType.I_MUL);
let tLParen = m1TType(tk.TokenType.L_PAREN);
let tRParen = m1TType(tk.TokenType.R_PAREN);
+let toSome = tk.toSome;
argv.forEach((val, index) => {
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; };
}
/**
let new_ast = [ast_tail];
a.value.ast = new_ast;
- console.log("+"+signal+"+"+repr(a));
+ // console.log("+"+signal+"+"+repr(a));
}
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 : tkTree[] = [inner];
let new_ast = [ast_middle];
a.value.ast = new_ast;
-
- console.log("+"+signal+"+"+repr(a));
-
-
}
return a;
}
-/** fac1 = "(" expr ")" */
-let fac1 = circumfix((x : TokenMatcheePair)=>
-thenDo(thenDo(thenDo(tk.toSome(x), tLParen), expr), tRParen), "fac1");
+/**
+ * TODO: 12(13)(14) only parsed with only 12(13)
+ */
+/** single1 = tInt | "(" expr ")"*/
+let single1 = circumfix((x : TokenMatcheePair) =>
+ 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 )
+ *
+*/
+
+
+/** fac = single ["(" single ")"]? | single
+ * Issue1 to be fixed.
+ */
+let fac1Appliee = circumfix((x : TokenMatcheePair) => thenDo(thenDo(thenDo(tk.toSome(x), tLParen), tInt), tRParen), "fac1");
+let fac1 = (x : TokenMatcheePair) =>
+ {
+ let raw = thenDo(thenDo(toSome(x), single), OnceOrMoreDo(fac1Appliee));
+
+
+
+ if (raw._tag == "Some"){
-let fac2 = tInt;
+ var result : tkTree = raw.value.ast[0];
+ let applyToken : tk.Token = {text: '%apply', ln:0, col:0};
+ for (var i=1; i<raw.value.ast.length; i++){
+ result = [applyToken, result, raw.value.ast[i]];
+ }
+
+ if (!Array.isArray(result)){
+ raw.value.ast = [result];
+ }else{
+ raw.value.ast = result;
+ }
+ }
+
+
+
+
+ return raw;
+ };
+let fac2 = single;
let fac = orDo(fac1, fac2);
+let tokens = tk.tokenize("1");
+let tokens2 = tk.tokenize("1(2)");
+let tokens3 = tk.tokenize("1(2)(3)");
+let tokens4 = tk.tokenize("(3(2))*2+1");
-let tokens = tk.tokenize("(4-(3/4))");//tk.tokenize(argv[2]);
-let tokensFiltered = tokens.filter(
+//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 wrappedTokens : tk.Maybe<TokenMatcheePair> =
- tk.toSome({
- matched : [] ,
- remained : tokensFiltered,
- ast : []});
+
let beta = expr({
matched : [] ,
remained : tokensFiltered,
ast : []});
+if (beta._tag == "Some"){
+ console.log(tkTreeToSExp(beta.value.ast));
+}
-console.log(repr(beta));
+console.log("RESULT="+repr(beta));
projects / clo / blobdiff