-/**
- * TokenMatcheePair for tokens' parser combinator
- * matched: the matched (now and before) tokens
- * remained: tokens to be matched
- * ast: abstract syntax tree
- */
-export interface TokenMatcheePair {
- matched: tk.Token[]
- remained: tk.Token[]
- ast : tkTree[]
-}
-
-/**
- * @description
- * 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 typ : the type to be test.
- * @returns the updated `TokenMatcheePair` wrapped in `Some(x)` or `None`.
- */
-export function m1TType(typ: tk.TokenType):
- (m: TokenMatcheePair) => tk.Maybe<TokenMatcheePair> {
- return (m: TokenMatcheePair) => {
- 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 : tk.Some<TokenMatcheePair> = {
- _tag: "Some", value: {
- matched: new_matched,
- remained: m.remained.slice(1),
- ast: ([ttbm]),
- }
- };
- return result;
- }
- else {
- return { _tag: "None" };
- }
- }
-};
-
-/**
- * type int
- */
-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);