Lexical analyser, Computer Engineering

The aim of this project is for you to construct a fully working compiler for a small simple programming language, SPL. The compiler will read in SPL source code and produce ANSI C as output.

A full description of the language is given in this document, from which, over the course of the semester, you will construct a compiler using some of the techniques learnt in the lectures and by using the Unix utilities Lex and Yacc or the Cygwin/linux utilities Flex and Bison.

At this point in the course you will not be able to attempt most of this project. Do not worry. Over the next few weeks you will be given the information necessary to attempt the various stages of the project as they arise.

The project is almost a whole semester long and is split in to five components, with milestones staged throughout the course of the semester. You should aim to show your completed work at each stage to a laboratory demonstrator who can track your progress and offer advice that might help you advance to the next part.

The component stages are as follows

A BNF description of the SPL language described by the roadmaps given in this document. This should be submitted on paper.

A Lexical Analyser file which will enable Flex or Lex to generate a working lexical analyser for the language.

A partially complete Parser file containing all of the code necessary to create a parse tree using the Yacc or Bison tools.

A complete Parser file which also includes a code generation function so that you now have a fully working compiler using the tools Yacc or Bison.

A word-processed report on the complete project. This should include printed examples demonstrating the operation of your compiler on both correct and incorrect code, and listings of the components.

If you are unable to complete any part for the whole SPL language you should reduce the language to a subset so that you can complete the compiler.

Posted Date: 3/9/2013 2:26:43 AM | Location : United States







Related Discussions:- Lexical analyser, Assignment Help, Ask Question on Lexical analyser, Get Answer, Expert's Help, Lexical analyser Discussions

Write discussion on Lexical analyser
Your posts are moderated
Related Questions
Binary Search Now that the basic framework is working, it is time to begin implementing a few alternative search functions. Each of these search algorithms have strengths and

(i)  Input a single ASCII character into BL register without echo on screen  CODE SEGMENT  MOV AH, 08H;         Function 08H  INT 21H          ;         the character inpu

How to Creating a Key Pair You can make a key pair using the Strong Name tool (Sn.exe). Key pair files usually have an .snk extension. To create a key pair at the command

Control Dependence Segments or Instructions in a program can include control structures. So, dependency among statements is able to be in control structures also. However the

This branch of AI is concerned with incorporating knowledge from varied disciplines such as biolog neurology psychology mathematics and several linked disciplines. It is typic

Make a page translation table the meets the requirements of the virtual memory system given below.  Suppose page (and frame) sizes of 20 with pages 0 by 3 in logical memory and fra

Transfer  Functions Change the last bilinear interpolated images and the original images into the frequency domain using the FFT.  Try to measure the magnitude transfer functio

Memory-to-Memory Architecture The pipelines can access vector operands intermediate and final results straight in main memory. This necessitates the higher memory bandwidth. Fu

Granularity Granularity refers to the quantity of computation done in parallel relative to the dimension of the entire program. In parallel computing, granularity is a qualitat

Q. Explain the Passive Matrix in lcd technology? In a passive matrix arrangement LCD panel has a grid of vertical and horizontal conductors and every pixel is positioned at an