Vladimir Keleshev

@keleshev.com

796 Followers 439 Following

OCaml programmer, author of Compiling to Assembly from Scratch: https://keleshev.com/cas Copenhagen

Onfim’s drawing of two people
A probable self portrait by Rafael, drawn when he was around the same age (1499), Ashmolean Museum, Oxford, UK.
@dataclass class Parser[T]: parse: Callable[[Source], ParseResult[T] | None] @staticmethod def regexp(regexp: Pattern) -> Parser[str]: return Parser(lambda source: source.match(regexp)) @staticmethod def constant[U](value: U) -> Parser[U]: return Parser(lambda source: ParseResult(value, source))
@dataclass class Parser[T]: _parse: Callable[[Source], ParseResult[T] | None] def parse(self, s: Source) -> ParseResult[T] | None: return self.__dict__['_parse'](s) @staticmethod def regexp(regexp: Pattern) -> Parser[str]: return Parser(lambda source: source.match(regexp)) @staticmethod def constant[U](value: U) -> Parser[U]: return Parser(lambda source: ParseResult(value, source))
Two Raspberry Pi 400 wrapped in Minecraft gift paper.
let size = fold ~leaf:(const 1) ~node:(+) let height = fold ~leaf:(const 1) ~node:(fun l r -> 1 + max l r) let to_string leaf = fold ~leaf ~node:(sprintf "(%s %s)") let reverse = fold ~leaf ~node:(fun l r -> node r l) let map f = fold ~leaf:(f >> leaf) ~node let bind f = fold ~leaf:f ~node let iter f = fold ~leaf:f ~node:(fun _ _ -> ()) let for_all predicate = fold ~leaf:predicate ~node:(&&) let exists predicate = fold ~leaf:predicate ~node:(||)
# Recursive definition of pattern required <- "(" _ pattern ")" _ optional <- "[" _ pattern "]" _ confined <- required / optional / atom _ multiple <- confined ("..." _)? sequence <- multiple multiple* junction <- sequence ("|" _ sequence)* pattern <- junction