Programming Language

It will recognize at least 4 primitive data types (integer, float, char, boolean, but with Turkish names) with following operations: • 4 arithmetic operations defined on integer and float data types • NOT operation for booleans (Turkish reserved Word is a must) • Catenation operation for char data type to obtain strings It will recognize integer and char arrays with following operations • Direct Access to array members (subscription) • 4 arithmetic operations on integer arrays • Assignment and catenation of char arrays to each other TPL has to contain a selection structure like IF as we have in C based languages TPL has to contain a repetition structure like WHILE as we have in C based languages • It must have a flexible structure for cases that we know / don’t know the number of repetitions TODO LIST Prepare a lookup table for reserved words and for signs defined in your language (like +,-,*,”,?) Which sign will be used for which operation or definition? Prepare a list with detailed explanations. Draw state diagrams to make the definitions of data types, variable definitions, selection structures, repetition structures, assignment operations, function definitions and calls. Also the main body of your source code (blocks – begin..end/ {..}). Design the assignments as functions. (Ex: x=x+1 will be written as topla(x,x,1)) x=y+5 (eşitle(x,topla(y,y,5)) Write a C program as given in the book to handle lexical analysis. Write EBNF rules to decide about your nonterminals to be implemented as functions in the syntax analysis. Write a separate C program to handle the syntax analysis. Prepare 3 small source code examples in TPL and save them as text files. You have to show how they are driven from your EBNF rules.