编译器课程的内容包括：
Assignment 1 Due Monday, April 24th, 11:59PM In this assignment, you will get some practice writing simple functions in OCaml that manipulate lists (Part 1) and trees (Part 2). Important Notes: Before starting this homework, make sure you have installed opam and OCaml following the instructions here. Next install the dependencies by doing opam install […]
CS160 Assignment 1 Read More »
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
“””Wumpus World. COMP3620/6320 Artificial Intelligence The Australian National University Authors: COMP-3620 team Date: 2022 Student Details ————— Student Name: Student Number: import argparse import sys def process_command_line_arguments() -> argparse.Namespace: “””Parse the command line arguments and return an object with attributes containing the parsed arguments or their default values. import json parser = argparse.ArgumentParser() parser.add_argument(“-i”, “–input”,
COMP6320 wumpus2csp Read More »
University of Nottingham Ningbo China School of Computer Science A Level 1 Module, Spring Semester 2022–2023 COMP1047: Systems and Architecture (AE1SYS) Coursework (Assessment Weight: 50%) Submission deadline: Friday 28th April 2023, 23:59:59 GMT+8 1 Synopsis This coursework is about MIPS programming implementation and testing, as well as con- ception of CPU design. You should answer
COMP1047 AE1SYS Coursework Read More »
1 Introduction CS-UY 2214 — Project 3 This project represents a substantive programming exercise. Like all work for this class, it is to be completed individually: any form of collaboration is prohibited, as detailed in the syllabus. This project is considered a take-home exam. Before even reading this assignment, please read the E20 manual thoroughly.
UY 221 Project 3 E20 cache simulator Read More »
#lang racket (provide (all-defined-out)) ;; don’t remove ;; CIS352 — Project 3 — Implementing Smolisp ;; Smolisp is a stripped-down version of Racket with top-level ;; definitions but no higher-order functions. Expressions include ;; literals, variables, let-binding and let*, if, cond, and function ;; calls. Crucially, however, functions may not appear without being ;; invoked
CIS352 Project 3 Smolisp Read More »
Project 3: Smolisp You will implement Smolisp, a dynamically-scoped subset of Racket that allows using define to define first- order functions. Expressions include literals, variables, let-binding and let*, if, cond, and function calls. Crucially, however, functions may only be invoked by name (i.e., no lambdas allowed), and functions may not return other functions. You will
CIS352 Project 3 Smolisp DrRacket Read More »
COMP6991 – 22T3 COMP6991 Final Exam Getting Started Create a new directory for this lab called exam_final, change to this directory, and fetch the provided code for the exam by running these commands: $ mkdir exam_final $ cd exam_final $ 6991 fetch exam Or, if you’re not working on CSE, you can download the provided
COMP6991 22T3 — Solving Modern Programming Problems with Rust Read More »
Objectives Week 10 Weekly Exercises Show how the final exam works. Prac exam from 22T3, followed by real exam from 22T3 None of these are marked, but obviously will be in the real exam The 23T1 exam will likely have 7 questions instead of 8 Activities To Be Completed The following is a list of
COMP6991 23T1 — Solving Modern Programming Problems with Rust Read More »
Question 1 [20 Marks] Write a program in MIPS32 assembly language which takes three input arguments: register A will receive a character, register B will receive another character, and register C will receive the initial address of a string. Within the string, your program will replace any occurrence of the character stored in register B