编译器课程的内容包括：
15–312: Principles of Programming Languages Midterm Examination March 9, 2017 • There are 14 pages in this examination, comprising 3 questions worth a total of 90 points. • You may refer to your personal notes and to Practical Foundations of Programming Languages, but not to any other person or source. • You may use your […]
Assignment 0: Judgments, Rules, and Church’s λ-Calculus 15-312: Principles of Programming Languages (Fall 2023) Welcome to 15-312! In this assignment, we will explore foundational concepts in programming languages through the lens of Church’s λ-calculus. In this first assignment, we are introducing the use of inductive definitions of judgments about terms in the λ-calculus. The λ-calculus
Kernel Compilation, Kernel Module, and System Call Implementation 1 Introduction The objective of this assignment is to familiarize yourself with the Linux kernel source code. Specifically, you will: • Compile your own Linux kernel. • Create your own kernel module. • Add a new kernel system call and then test this system call from a
# -*- coding: utf-8 -*- findX.py – Intro to Graduate Algorithms, Spring 2024 Solve the findX in an Infinite array problem (DPV 2.16) using a Divide & Conquer method Your runtime must be O(log n) The array of values is indexed A[1..] inclusive Your code MUST NOT directly reference any variables in findX. The following
Programming Assignment #1 (Lab 1): Linker Professor Hubertus Franke Class CSCI-GA.2250-001: Operating Systems – Fall 2023 In this lab you will be implementing a two-pass linker. In general, a linker takes individually compiled code/object modules and creates a single executable by resolving external symbol references (e.g. variables and functions) and module relative addressing by assigning
CSCI GA.2250 001 lab1 linker fall23 Read More »
The Australian National University Final Examination – November 2020 Comp2310 & Comp6310 Systems, Networks and Concurrency Study period: Time allowed: Total marks: Permitted materials: 15 minutes 3.5 hours (after study period) 100 Questions are not equally weighted – sizes of answer boxes do not nec- essarily relate to the number of marks given for this
Comp2310 & Comp6310 Final Exam.20 Read More »
Homework 3. Multithreaded gzip compression filter Background You’re working for a web server house that regularly needs to generate some fairly large data streams and compress them using gzip. The compression part of this is turning into a CPU bottleneck and the users are starting to complain. Your company can easily afford to throw hardware
Homework 2. Naive parsing of context free grammars Motivation You’d like to test grammars that are being proposed as test cases for CS 132 projects. One way is to test it on actual CS 132 projects, but those projects aren’t done yet and anyway you’d like a second opinion in case the student projects are
CS 132 projects. One way is to test it on actual CS 132 projects, but those proj Read More »
module FinalProject01 where import Control.Applicative(liftA, liftA2, liftA3) import Data.List import CFGParsing bottomUp :: (Eq nt, Eq t) => CFG nt t -> [t] -> [[ParseStep nt t]] bottomUp cfg input = let (nts, ts, start, rules) = cfg in let startingConfig = ([], input) in let goalConfig = ([NoBar start], []) in parser [shift, reduce]
LING185A FinalProject01 Stub Read More »
LING185A, Fall 2023 Laurel Perkins Final Project Due: Fri. 12/15/2023, 11:59pm Pacific The goal of your final project is to show that you have developed an understanding of the themes that have run throughout the quarter, and can extend these concepts creatively to tackle interesting computational problems in natural language. You can choose among three
LING185A Final Project Read More »