Latte Compiler

Sun, 21 Jan 2024 00:00:00 +0000

One of the major projects during my graduate studies was building a compiler for the Latte language, extended with features such as arrays, structs, and objects with single inheritance. The compiler parses Latte code using the BNFC tool and compiles it into x86 assembly.

The compiler’s core is implemented using a Reader-Writer-State monad:

data Reader = Rd
 { func :: Map.Map String TType
 , clss :: Map.Map String ClassEnv
 }
type Writer = [AsmInstr]
data State = St
 { nextlab :: Int
 , newloc :: Int
 , env :: Map.Map String (TType, String)
 , rodata :: Map.Map String String
 , rspOff :: Int
 }

where

Polynomial degree

Tue, 10 May 2022 00:00:00 +0000

Polynomial degree is a pure assembly project. The goal is to implement the following function

int polynomial_degree(int const *y, size_t n);

The function takes two arguments: a pointer y to an array of integers $y_0,y_1,\ldots,y_{n-1}$ and an integer n representing the length of this array. The function calculates the lowest degree of a single-variable polynomial $w(x)$ with real coefficients, such that: $w(x+k\cdot r)=y_k$ for some real number $x$, a nonzero real number $r$, and $k=0,1,\ldots,n-1$.

Assembly on grzenow

Latte Compiler

Polynomial degree