X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.ts;h=44aa79282788f7f8fd28679017ceb114c49c3149;hb=c3dc58d74afa6b298d84bad90d63c027a32a954a;hp=883d94b742145129ff948e0325d94457b274b8f1;hpb=5fbb467bdf501dee03c78817242581d962547c4f;p=clo diff --git a/src/index.ts b/src/index.ts index 883d94b..44aa792 100644 --- a/src/index.ts +++ b/src/index.ts @@ -1,362 +1,68 @@ var fs = require('fs'); +var argv : any = require('minimist')(process.argv.slice(2)); -export type Some = { _tag: "Some"; value: T }; -export type None = {_tag: "None"}; - - -/** - * wrap a x in a `Some(T)` - * @param x : variable to be wrapped. - * @returns wrapped `x`. - */ -function toSome(x: T): Some{ - return { _tag: "Some", value: x}; -} -/** - * @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 - * @var matched : have been matched - * @var remained : will be tested whether it'll be matched. - * @var matched_type (optional): the type of the matched string -*/ -export interface MatcheePair { - matched : string - remained : string - matched_type?: TokenType -} - -/** - * The types of Token - * NL, // newline - * - * SP, // half-width space and tab - * - * ID, // identifier - * - * STR, // string - * - * OP, // operator or something like it - * - * FLO, // float num - * - * INT, // Integer - */ -export enum TokenType{ - NL, // newlinw - SP, // half-width space and tab - ID, // identifier - STR, // string - OP, // operator - FLO, // float num - INT, // integer -} - -/** - * tokenized token. - * @var text : the content text - * @var type (optional): the type of the token - * @var col : the column number - * @var ln : the line number - */ -export interface Token{ - text: string, - type?: TokenType, - col: number, - ln: number, -} - -/** - * @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. - * @returns the updated `MatchedPair` wrapped in `Some(x)` or `None`. - */ -export function match1Char(c : string) : (m: MatcheePair) => Maybe { - return (m : MatcheePair)=>{ - if (m.remained.length == 0){ - return { _tag: "None" }; - } - const charToBeMatched = m.remained[0]; - if (charToBeMatched === c){ - return {_tag: "Some", value :{ - matched : m.matched + charToBeMatched, - remained : m.remained.substring(1)}}; - } - else{ - return {_tag: "None"}; - } - } -}; - -/** - * - * @param m : the `MatcheePair` to be consumed. - * @returns if the length of `m.remained` >= 1; consumes the matchee by 1 char and wraps it in `Some`, - * otherwise, returns `None`. - */ -export function matchAny(m : MatcheePair) : Maybe{ - if (m.remained.length >= 1){ - return {_tag: "Some", value :{ - matched : m.matched + m.remained[0], - remained : m.remained.substring(1)}}; - }else{ - return {_tag: "None"}; - } -} - -/** - * @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)=>{ - if (m.remained.length < 1){ - return {_tag : "None"}; - } - 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"}; - } - } -}; +import * as parser from "./parser.js"; /** - * 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`. + * help for inputing `--help` parameter. */ -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); - } -} +export let helpDesc = +` +clo: clo INPUT_FILE --output-js OUTPUT_JS_FILE -/** - * @description thendo(input, f, ...) like - * a ==> f - * @param input: the wrapped input. - * @param f: the function to be applied. - * - * @returns:the applied wrapped result `MatcheePair`. - */ -export function thenDo(input : Maybe, f : Function) : Maybe{ - if (input._tag == "None"){ - return input; - } - else{ - let inner = input.value; - return f(inner); - } -} - -/** - * @description "or", like the regex `( f1 | f2 )` . - * It returns a function `f` of which the argument is`x`. - * if `f1(x)` is None, then `f` returns `f2(x)`. Otherwise, - * `F` returns `f1(x)`. - * @param f1 : 1st function to be compared - * @param f2 : 2nd function to be compared - * @returns:the combined function - */ -export function orDo(f1 : Function, f2: Function) : (x : T ) => Maybe{ - return (x) => { - let f1x : Maybe = (f1(x)); - { - if (f1x._tag == "None"){ - return f2(x); - } - else{ - return f1x; - } - } - }; -} +\ta little typesetter powered by TypeScript/Javascript. +## Arguments +INPUT_FILE\tan input .clo file -/** -* @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 zeroOrMoreDo(f : Function): (x : T) => Maybe{ - return (x)=>{ - var wrapped_old_x : Maybe = {_tag: "Some", value : x}; - var wrapped_new_x : Maybe = wrapped_old_x; +## Parameters +--- +--output-js\tgenerated the output middle JS file - while (wrapped_new_x._tag != "None"){ - wrapped_old_x = wrapped_new_x; - wrapped_new_x = thenDo(wrapped_old_x, f); - }; - return wrapped_old_x; - }; -} +Report bugs to: clo@kianting.info +clo home page: +` -/** -* @description Not. like the `^` inside regex of [^f]. -* returns a function `F(x)` such that if `f(x)` is `None`, -* returns the x consuming a char; if `f(x)` is not None, F(x) -* returns `None`. -* @param f: the function forbidden to be matched. -* @returns: combined function `F`. -*/ -export function notDo(f : Function): (x : T) => Maybe{ - return (x)=>{ - let wrapped_x : Maybe = { - _tag : "Some", - value : x - }; - let f_x = thenDo(wrapped_x, f); - - if (f_x._tag != "None"){ - return {_tag:"None"}; - }else{ - return thenDo(wrapped_x, matchAny); - } - }; -} +processArgv(argv, helpDesc); /** - * if `x` is matched by `f` once, returns `f(x)`. Otherwise, - * returns x - * similar to `?` in regex `f?`. - * @param f : the function to be matched - * @returns return wrapped f(x) + * processing the passed `argv` (arguments) */ -export function zeroOrOnceDo(f : Function): (x : T) => Maybe{ - return (x)=>{ - var wrapped_old_x : Maybe = {_tag: "Some", value : x}; - var wrapped_new_x = thenDo(wrapped_old_x, f); - - if (wrapped_new_x._tag != "None"){ - return wrapped_new_x; - }else{ - return wrapped_old_x; - } - }; -} +export function processArgv(argv : any, helpDesc : string){ + let inputFile : string[] = argv['_']; + let outputJSFile : string | true = argv['output-js']; -export function tokenize(input : string){ - var input_matchee_pair : Maybe = toSome( - {matched:"", - remained: input}); + let NoInputFile : boolean = (inputFile.length == 0); + let NoOutputJSFile : boolean = (outputJSFile === undefined || outputJSFile == true); + let helpTriggered : boolean = argv['help']; - // integer = ([+]|[-])?\d\d* - let integer = (x : MatcheePair) => - { let wrapped_x = toSome(x); - let plusMinus = orDo(match1Char('+'), match1Char('-')); // ([+]|[-]) - let d = matchRange('0','9'); // \d - var result = thenDo(thenDo(thenDo(wrapped_x, - zeroOrOnceDo(plusMinus)),d), - zeroOrMoreDo(d)); - - if (result._tag == "Some"){ - result.value.matched_type = TokenType.INT; - } - return result; - } - let space = (x : MatcheePair) =>{ - let wrapped_x = toSome(x); - let s_aux = orDo(match1Char(' '), match1Char('\t')); // (" " | "\t") - var result = thenDo(thenDo(wrapped_x, s_aux), zeroOrMoreDo(s_aux)); - if (result._tag == "Some"){ - result.value.matched_type = TokenType.SP; - } - return result; + if (inputFile.length > 1){ + console.log("Sorry, the input file should be only one."); } - let newline = (x : MatcheePair) =>{ - let wrapped_x = toSome(x); - // nl = \r?\n - let result = thenDo(thenDo(wrapped_x, - zeroOrOnceDo(match1Char('\r'))), match1Char('\n')); - if (result._tag == "Some"){ - result.value.matched_type = TokenType.NL; - } - return result; - } - - let term = (token_list : Array, x : Some)=>{ - var ln = 1; - var col = 0; - var old_x = x; - let term_list = [newline, space, integer]; - let term_aux = term_list.reduce((x,y)=> orDo(x,y)); - var new_x : Maybe = thenDo(old_x, term_aux); - while (new_x._tag != "None"){ - if (new_x.value.matched_type != TokenType.NL){ - col += new_x.value.matched.length; - token_list.push({text : new_x.value.matched, - type: new_x.value.matched_type, - ln : ln, - col : col}); - - } - else{ - col = 0; - ln += 1; - - token_list.push({text : new_x.value.matched, - type: new_x.value.matched_type, - ln : ln, - col : col}); - - } + /** output --help */ + if (helpTriggered || NoInputFile || NoOutputJSFile){ + console.log(helpDesc); + }else{ + fs.readFile(inputFile[0], 'utf8', (err : Error, inputText : string) => { + if (err) throw err; + let tree = parser.inputTextToTree(inputText); - old_x = toSome({matched : "", - remained : new_x.value.remained}); - new_x = thenDo(old_x, term_aux); - } + let output = parser.treeToJS(tree); - if (old_x.value.remained.length){ - console.log(token_list); - throw new Error("the code can't be tokenized is near Ln. "+ln+", Col."+col - +", starting with "+ old_x.value.remained.substring(0,10)); - } + fs.writeFile(outputJSFile, output , (err : Error) => { + if (err) throw err; + }); - return token_list; + }); } - console.log(term([], input_matchee_pair)); +} + - // TODO: id, string, space, basic operator, 3 marks: @, {, }. -}