jecepeda / functional-compiler

A pseudocode compiler and interpreter using haskell, alex and happy

functional-compiler

This repository is one case study in the subject "Programación declarativa" taught at UCLM

The objectives of the case study are:

• Write an interpreter
• Use Haskell to write the interpreter

How to compile the project?

1. First, install Stack
2. Then, clone this repository

• git clone https://github.com/JCepedaVillamayor/funcional-compiler.git

3. Go to the project folder and build the project

• cd <project-path>
• stack build

What tools have been used?

• The lexer has been implemented using Alex, which is a tool for generating lexical analyzers in Haskell. This tool is similar to the tool Flex and Jflex. A tutorial showing how to use alex can be found here
• The syntax parser has benn implemented using Happy. Happy is a parser generator system: it takes a file containing a BNF specification and produces a Haskell containing a parser for the grammar. A tutorial showing how to use Happy can be found here

Which language do we want to describe?

The BNF syntax for the grammar can be found here

¿How to run the code?

Once the project is built, you need to execute the following command:

• stack exec functional-compiler-exe

functional-compiler's Issues

Document the project

Once we've finished the project, we need to explain all the steps involved in the project.

One option is to use LaTex, the other is to use Office

Describe the language for the project

The language we are implementing are not written yet. We need to upload a final version of the language we want to implement

Rewrite the code to support full grammar

The grammar made earlier was designed to make a proof of concept. It is necessary to make a grammar of a complete language, and implement the evaluator of it.

Add test for Grammar.y

Grammar.y needs tests to prove that the structures works

Build evaluator

Now that we have a lexer analyzer and a grammar parser, we need a module which evaluates the program.

• The skeleton is done: we need to implement the different structures given in Grammar.y.
• The data structure is created: we need to create a function which checks if the value exists or not (we can change de grammar in orde to implement better this functionality)

The task is to develop the interpreter. Test can be done in order to implement the functionality