OCaml 代写

Ocaml是一种面向对象的函数式编程语言,它结合了函数式编程的表达能力和面向对象的编程的模型。它提供了强大的类型系统和安全的编译环境,使得Ocaml成为非常适用于数学研究和系统性编程的编程语言。Ocaml最早于1996年来自INRIA(Institut National de Recherche en Informatique et Automatique)出现,其开发者是Xavier Leroy, Damien Doligez, Alain Frisch, Jacques Garrigue,Didier Rémy及Stephen Dolan。Ocaml有多种变体,如Objective Caml,Caml Special Light,Caml Light,Camlp4,OCamljava,OCamljs等。

CS160 A2 OCaml

CS160 Assignment 2 Due: Monday, May 8th 11:59pm Prerequisites 1. Forthisproject,we’llneedmoredependenciesfromopam.Do: opam install ocamlgraph ppx_hash odoc before starting this project. 2. IfyouareonMacOS,makesuretoinstallGraphvizifyouhaven’talready.Youcandosowithbrew: brew install graphviz On CSIL, Graphviz is already installed. Important Notes 1. Forthisassignment,youareallowedtouseanyofthestandardlibraryfunctionsfromList.You’llfind List.map , List.concat_map , List.fold_right especially helpful. 2. Someofthefunctionsinthisassignmentuselabeledarguments.Makesuretoreaduponhowlabeled arguments work in OCaml. 3. Wehaveprovidedalotofusefuldatastructuresandhelperfunctionsforthisassignment,andhave documented their expected usage. You …

CS160 A2 OCaml Read More »

Ocaml DFA Parser

Problem 1 Let us write a compiler that translates regular expressions to deterministic finite automata (DFAs). 2. Youcanfindthefollowingfiles: • main.ml: Driver code with some test cases. You can add your own test cases here. • regex.ml: The definition of regular expressions (the “source lan- guage” of our compiler). • nfa.ml: NFA implementation (the “intermediate representation” …

Ocaml DFA Parser Read More »

COMP302 HW4 OCaml Code

COMP302 HW4 OCaml Code (* ————————————————————————*) (* Q1 : Money in the Bank *) (* ————————————————————————*) let open_account (initial_pass: passwd) : bank_account = notimplemented () (* ————————————————————————*) (* Q2 : I Want to Travel *) (* ————————————————————————*) (* TODO: Write some tests for neighbours. Consider creating a graph first, and then writing your tests based …

COMP302 HW4 OCaml Code Read More »

COMP302 A3 Programming Languages And Paradigm OCaml代写

In this assignment, you will use exception-based backtracking to solve a well- known problem called SAT. SAT is short for “boolean satisfiability.” Simply put, if you have a boolean formula with variables, SAT asks if there is any way to assign true and false to each variable so that the value of the formula is …

COMP302 A3 Programming Languages And Paradigm OCaml代写 Read More »

GA2130 PS1

PS1 Due Date: 2023-02-08 Points: 6 Your job for this assignment is to write a Mips interpreter for a small subset of Mips machine code. The starter code includes a file to parse a small subset of Mips assembly as well as an assembler that loads the machine code into a simple model of a …

GA2130 PS1 Read More »