This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import { Base64 } from "https://deno.land/x/bb64/mod.ts"; | |
import { join } from "https://deno.land/std/path/mod.ts"; | |
import { exists } from "https://deno.land/std/fs/mod.ts"; | |
const debug = (x: T): T => { | |
console.error(x); | |
return x; | |
}; | |
const assertEnv = (key: string): string => { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def infix(tree): | |
if type(tree) == int: | |
return str(tree) | |
elif len(tree) == 3: | |
t1, op, t2 = tree | |
return "({} {} {})".format(infix(t1), op, infix(t2)) | |
else: | |
raise ValueError("Malformed expression tree.") | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
s/\(.*\)/\L\1/g | |
s/[^a-z ]//g | |
s/\s\+/ /g | |
s/^ //g | |
# i initiale | |
s/\bi\([aeouy]\)/j\1/g | |
# synizesis / synalloephe | |
s/\([aeiou]m\?\) est/\1st/g |