X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.ts;h=55e3d65db7b9894c9aead54e69cfa73e657a1520;hb=cda463d89022d09a5273b59bcd3e776f1127697a;hp=26cd10df0e081ec2ce445b72c26aeef17bdde0bb;hpb=4cfa9c7cb47795674b6f2c2f2d0f63fe24100c49;p=clo diff --git a/src/index.ts b/src/index.ts index 26cd10d..55e3d65 100644 --- a/src/index.ts +++ b/src/index.ts @@ -1,104 +1,46 @@ var fs = require('fs'); -type Some = { _tag: "Some"; value: T }; -type None = {_tag: "None"}; +import * as tk from './tokenize.js'; -/** - * @description Like the `Some(a)` and `None` in Rust. - * - * @example - * ```ts - * let exam1 : Maybe = { _tag: "Some", value: 12 }; - * let exam2 : Maybe = None; - * ``` - */ -export type Maybe = Some | None; -/** - * @description - * the pair of the string to be matched later and the string that have been matched - * @param matched : string have been matched - * @param remained : string will be tested whether it'll be matched. - */ -export type MatcheePair = {matched : string; remained : string}; +let b : Array = tk.tokenize("2+2"); + +export interface TokenMatcheePair { + matched: tk.Token[] + remained: tk.Token[] +} /** * @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 * in `Some`. Otherwise, it returns `None`. - * * @param c : the char to be test. + * * @param t : the char to be test. * @returns the updated `MatchedPair` wrapped in `Some(x)` or `None`. */ -export function match1Char(c : string) : (m: MatcheePair) => Maybe { - return (m : MatcheePair)=>{ - const charToBeMatched = m.remained[0]; - if (charToBeMatched === c){ - return {_tag: "Some", value :{ - matched : m.matched + charToBeMatched, - remained : m.remained.substring(1)}}; +export function match1token(t: tk.Token): (m: TokenMatcheePair) => tk.Maybe { + return (m: TokenMatcheePair) => { + if (m.remained.length == 0) { + return { _tag: "None" }; } - else{ - return {_tag: "None"}; + const tokenToBeMatched = m.remained[0]; + if (tokenToBeMatched === t) { + m.matched.push(tokenToBeMatched); + return { + _tag: "Some", value: { + matched: m.matched, + remained: m.remained.slice(1) + } + }; } - } -}; - -/** - * @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`. - */ -export function matchRange(l : string, u : string) : (m: MatcheePair) => Maybe { - 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 : MatcheePair)=>{ - - 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)}}; - } - else{ - return {_tag: "None"}; + else { + return { _tag: "None" }; } } }; -/** - * 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`. - */ -export function charToCodepoint(s : string): number{ - if (s.length > 1){ - throw new Error("Error: the length of input string for "+s+ "is "+s.length+`, - however, it should be 1.`); - }else{ - return s.charCodeAt(0); - } -} -/** - * @description thendo(input, f, ...) like - * a ==> f - */ -export function thenDo(input : Maybe, f : Function) : Maybe{ - if (input._tag == "None"){ - return input; - } - else{ - let inner = input.value; - return f(inner); - } -} + +let c = tk.toSome(b); +console.log(thenDo(c,match1token(tk.tokenize("+")[0]))); \ No newline at end of file