🧮 Languages and Computation

CPSC 3400

Topics

• Common paradigms, features, organization, and tradeoffs of modern programming languages
  • Semantics
  • Garbage Collection
  • Memory Management
  • Type Systems
  • Compiler Design (Lexing, Parsing, Code Generation, Interpreters)
• Theoretical foundations of languages and computation
  • Regular Expressions
  • Language Classification
  • Grammars
  • Finite State Automata (NFA/DFA)
  • Turing Machines
• Programming using scripting languages and functional languages

Projects

🎨 Color Survey ^{Python hw1}

Tabulate the results of a survey where people were asked to vote for their top three favorite colors. The results of the survey are stored in an input file.
_{More information can be found here.}

⏱️ Time Processor ^{Python hw2}

A program that parses a string representation of a time and returns them in a Python data structure (tuple).
_{More information can be found here.}

♻️ Garbage Collector ^{Python hw3}

Simulation of a Mark-and-Sweep Garbage Collector with Variables, Pointers, and Heap blocks.
_{More information can be found here.}

♾️ F# Exercises ^{F# hw4}

A collection of functions written in F# — a functional programming language. Featuring tail recursion, pattern matching, and discriminated unions.

Max Cylinder Volume

Takes in a list of floating-point tuples that represent dimensions of a cylinder and returns the volume of the cylinder that has the largest volume. Uses tail recursion.

Eliminate Consecutive Duplicates

Takes in a list of integers and eliminates consecutive duplicates; replacing them with a single instance of the value. Order is preserved and non- consecutive duplicates are unaffected. Uses tail recursion.

Binary Search Tree

An implementation of a binary search tree with insert, search, and count using a discriminated union.

_{More information can be found here.}

➗ Algebraic Simplifier ^{F# hw5}

Simplifies an algebraic expression with recursion, pattern matching, and a discriminated union. Supports addition, subtraction, multiplication, and division.
_{More information can be found here.}

👌 Regular Expressions and Deterministic Finite State Automata (DFA) ^{Python hw6}

• Simple Python regular expressions
• Deterministic Finite State Automata for accepting/rejecting strings

_{More information can be found here.}

🎰 Turing Machines and Context-Free Grammars ^hw7

• Context-Free Grammars for accepting/rejecting strings in a defined Regular Language
• Turing Machine for accepting/rejecting strings matching a Regular Expression with backreferences
• Turing Machine for transforming an input string

_{More information can be found here.}

🗃️ Language Interpreter ^{Python extra credit}

A program that parses and executes a script written in a custom scripting language. This custom scripting language is composed of sequential pipelines that perform basic operations on data (similar to SQL, Awk, Sqlunk's query language, etc.). The input data is stored in a CSV file.
_{More information can be found here.}

---

Assignments created by Professor Kevin Lundeen.