JAVA Programming

Swarnandhra College of Engineering and Technology

B.Tech-CSE | R23 | Academic Year: 2024-2025

Lab Course: 23CS4L02 - OOP Through Java Lab

Department	CSE
Programme Name	B.Tech-CSE
Regulation	R23
Academic Year	2024-2025
Lab Course Code	23CS4L02
Lab Course Name	OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB

Exercises

• Exercise – 1: a) Default Values in JAVA b) Quadratic Equation Roots
• Exercise – 2: a) StringBuffer Manipulation b) Implementing Class Mechanism
• Exercise – 3: a) Method Overloading b) Implementing Constructors c) Constructor Overloading
• Exercise – 4: a) Single Inheritance b) Multi-Level Inheritance c) Abstract Class for Shapes
• Exercise – 5: a) Using "super" Keyword b) Implementing Interfaces c) Runtime Polymorphism
• Exercise – 6: a) Exception Handling b) Multiple Catch Clauses c) Java Built-in Exceptions d) User Defined Exceptions
• Exercise – 7: a) Creating Threads b) isAlive and join() Methods c) Daemon Threads d) Write a JAVA program Producer Consumer Problem
• Exercise – 8: a) JDBC Connection b) JDBC Insert Operation c) JDBC Delete Operation

Exercise 1

• a) Default values of all primitive types
• b) Roots of quadratic equation

Exercise 2

• a) StringBuffer operations
• b) Class mechanism

Exercise 3

• a) Write a JAVA program implements method overloading.
• b) Write a JAVA program to implement constructor
• c) Write a JAVA program to implement constructor overloading.

Exercise 4

• a) Write a JAVA program to implement Single Inheritance
• b) Write a JAVA program to implement multi level Inheritance
• c) Write a JAVA program for abstract class to find areas of different shapes

Exercise 5

• a) Write a JAVA program give example for “super” keyword
• b) Write a JAVA program to implement Interface. What kind of Inheritance can be achieved?
• c) Write a JAVA program that implements Runtime polymorphism

Exercise 6

• a) Write a JAVA program that describes exception handling mechanism
• b) Write a JAVA program Illustrating Multiple catch clauses
• c) Write a JAVA program for creation of Java Built-in Exceptions
• d) Write a JAVA program for creation of User Defined Exception

Exercise 7

• a) Write a JAVA program that creates threads by extending Thread class. First thread display “Good Morning “every 1 sec, the second thread displays “Hello “every 2 seconds and the third display “Welcome” every 3 seconds, (Repeat the same by implementing Runnable)
• b) Write a program illustrating is Alive and join ()
• c) Write a Program illustrating Daemon Threads.
• d) Write a JAVA program Producer Consumer Problem

Exercise 8

• a) Write a java program that connects to a database using JDBC.
• b) Write a java program to connect to a database using JDBC and insert values into it. ()
• c) Write a java program to connect to a database using JDBC and delete values from it.

Source Code: Default values of all primitive types

  class DefaultDemo {
    static byte b;
    static short s;
    static int i;
    static long l;
    static float f;
    static double d;
    static char c;
    static boolean bl;

    public static void main(String[] args) {
        System.out.println("Default values of primitive data types:");
        System.out.println("Byte: " + b);
        System.out.println("Short: " + s);
        System.out.println("Int :"+i); 
        System.out.println("Long :"+l); 
        System.out.println("Float :"+f); 
        System.out.println("Double :"+d); 
        System.out.println("Char :"+c); 
        System.out.println("Boolean :"+bl);
        
    }
}

Output:

Output will be displayed here. OUT-PUT: The default values of primitive data types are: Byte :0 Short :0 Int :0 Long :0 Float :0.0 Double :0.0 Char : Boolean :false

Source Code: Roots of Quadratic Equation

      import java.util.Scanner;

public class QuadraticEquation {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        
        System.out.print("Enter a: ");
        double a = scanner.nextDouble();
        
        System.out.print("Enter b: ");
        double b = scanner.nextDouble();
        
        System.out.print("Enter c: ");
        double c = scanner.nextDouble();
        
        double discriminant = b * b - 4 * a * c;
        
        if (discriminant > 0) {
            // Two real roots
        } else if (discriminant == 0) {
            // One real root
        } else {
            // Complex roots
        }
    }
}

      

Output:

Output will be displayed here.

Source Code: example for “super” keyword

class A
{
int i, j;
A()
{
i = 0;
j = 0;
}
A(int a, int b)
{
i = a;
j = b ;
}
void show()
{
System.out.println ("i and j : "+ i +" " + j);
}
}
class B extends A
{
int k;
B()
{
super();
k = 0;
}
B(int a, int b, int c)
{
super(a, b);
k =c;
}
void show()
{
super.show();
System.out.println("k:" + k);
}
}
class SuperKeyword
{
public static void main ( String args[])
{
B subob = new B( 1, 2, 3 );
subob.show();
}
}

Output:

Output will be displayed here.

Source Code: b) Write a JAVA program to implement Interface. What kind of Inheritance can be achieved?

class Number
{
protected int x;
protected int y;
}
interface Arithmetic
{
int add(int a, int b);
int sub(int a, int b);
}
class UseInterface extends Number implements Arithmetic
{
public int add(int a, int b)
{
return(a + b);
}
public int sub(int a, int b)
{
return (a - b);
}
public static void main(String args[])
{
UseInterface ui = new UseInterface();
System.out.println("Addition --- >" + ui.add(2,3));
System.out.println("Subtraction ----- >" + ui.sub(2,1));
}
}

Output:

Output will be displayed here.

Source Code: c) Implementation Runtime Polymorphism

import java.io.*;
class Override
{
public void methodoverride()
{
System.out.println("This is base class Method");
}
}
class Overridederived extends Override
{
public void methodoverride()
{
System.out.println("This is Derived class Method");
}
}
public class Methodoverride
{
public static void main(String args[]) throws IOException
{
Override ob=new Override();
Override ob1=new Overridederived();
ob.methodoverride();
ob1.methodoverride();
}
}

Output:

Output will be displayed here.

Exercise 6.a) Write a JAVA program that describes exception handling mechanism Source Code: Exception handling mechanism

SOURCE-CODE:
Usage of Exception Handling:
class trydemo
{
public static void main(String args[])
{
try
{
int a=10,b=0; int c=a/b;
System.out.println(c);
}
catch(ArithmeticException e)
{
System.out.println(e);
}
System.out.println("After the catch statement");
}
}

Output:

java.lang.ArithmeticException: / by zero After the catch statement

Exercise 6. b) Write a JAVA program Illustrating Multiple catch clauses Source Code:

class multitrydemo
{
public static void main(String args[])
{
try
{
int a=10,b=5; int c=a/b;
int d[]={0,1}; System.out.println(d[10]); System.out.println(c);
}
catch(ArithmeticException e)
{
System.out.println(e);
}
catch(ArrayIndexOutOfBoundsException e)
{
System.out.println(e);
}
System.out.println("After the catch statement");
}
}

Output:

java.lang.ArrayIndexOutOfBoundsException: 10 After the catch statement

Exercise 6.c) Write a JAVA program for creation of Java Built-in Exceptions Source Code:

(i) Arithmetic exception
class arithmeticdemo
{
public static void main(String args[])
{
try
{
int a = 10, b = 0; int c = a/b;
System.out.println (c);
}
catch(ArithmeticException e)
{
System.out.println (e);
}
}
}
(ii) NullPointer Exception
class nullpointerdemo
{
public static void main(String args[])
{
try
{
String a = null; System.out.println(a.charAt(0));
}
catch(NullPointerException e)
{
System.out.println(e);
}
}
}
(iii) StringIndexOutOfBound Exception
class stringbounddemo
{
public static void main(String args[])
{
try
{
String a = "This is like chipping "; char c = a.charAt(24); System.out.println(c);
}
catch(StringIndexOutOfBoundsException e)
{
System.out.println(e);
}
}
}
(iv) FileNotFound Exception
import java.io.*;
class filenotfounddemo
{
public static void main(String args[])
{
try
{
File file = new File("E://file.txt"); FileReader fr = new FileReader(file);
}
catch (FileNotFoundException e)
{
System.out.println(e);
}
}
}
(v) NumberFormat Exception
class numberformatdemo
{
public static void main(String args[])
{
try
{
int num = Integer.parseInt ("akki") ; System.out.println(num);
}
catch(NumberFormatException e)
{
System.out.println(e);
}
}
}
(vi) ArrayIndexOutOfBounds Exception
class arraybounddemo
{
public static void main(String args[])
{
try
{
int a[] = new int[5]; a[6] = 9;
}
catch(ArrayIndexOutOfBoundsException e)
{
System.out.println (e);
}
}
}

Output:

(i) Arithmetic exception java.lang.ArithmeticException: / by zero ________________________________________ (ii) NullPointer Exception java.lang.NullPointerException ________________________________________ (iii) StringIndexOutOfBound Exception java.lang.StringIndexOutOfBoundsException: String index out of range: 24 ________________________________________ (iv) FileNotFound Exception java.io.FileNotFoundException: E:\file.txt (The system cannot find the file specified) ________________________________________ (v) NumberFormat Exception java.lang.NumberFormatException: For input string: "akki" ________________________________________ (vi) ArrayIndexOutOfBounds Exception java.lang.ArrayIndexOutOfBoundsException: 6

Exercise 6. d) Write a JAVA program for creation of User Defined Exception Source Code:

class A extends Exception
{
A(String s1)
{
super(s1);
}
}
class owndemo
{
public static void main(String args[])
{
try
{
throw new A("demo ");
}
catch(Exception e)
{
System.out.println(e);
}
}
}

Output:

A: demo

Source Code: Write a JAVA program that creates threads by extending Thread class. First thread display “Good Morning “every 1 sec, the second thread displays “Hello “every 2 seconds and the third display “Welcome” every 3 seconds,(Repeat the same by implementing Runnable)

SOURCE-CODEs:
(i) Creating multiple threads using Thread class
class A extends Thread
{
public void run()
{
try
{
for(int i=1;i<=10;i++)
{
sleep(1000); System.out.println("good morning");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class B extends Thread
{
public void run()
{
try
{
for(int j=1;j<=10;j++)
{
sleep(2000); System.out.println("hello");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class C extends Thread
{
public void run()
{
try
{
for(int k=1;k<=10;k++)
{
sleep(3000); System.out.println("welcome");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class threaddemo
{
public static void main(String args[])
{
A a1=new A();
B b1=new B();
Cc1=newC(); a1.start();
b1.start();
c1.start();
}
}
__________________________________________

(ii) Creating multiple threads using Runnable interface
class A implements Runnable
{
public void run()
{
try
{
for(int i=1;i<=10;i++)
{
Thread.sleep(1000); System.out.println("good morning");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class B implements Runnable
{
public void run()
{
try
{
for(int j=1;j<=10;j++)
{
Thread.sleep(2000); System.out.println("hello");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class C implements Runnable
{
public void run()
{
try
{
for(int k=1;k<=10;k++)
{
Thread.sleep(3000); System.out.println("welcome");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class runnabledemo
{
public static void main(String args[])
{
A a1=new A(); B b1=new B(); C c1=new C();
Thread t1=new Thread(a1); Thread t2=new Thread(b1); Thread t3=new Thread(c1); t1.start();
t2.start();
t3.start();
}
}

Output:

good morninghello good morninggood morningwelcome hello good morning good morning hello good morning welcome good morninghello good morninggood morningwelcome hello good morninghello welcome hello welcome hello hello welcome hello welcome welcome welcome welcome ___________________________________________________ good morning good morning hello good morning welcome good morninghello good morninggood morningwelcome hello goodmorning goodmorning hello good morning welcome good morning hello welcome hello hello welcome hello welcome hello hello welcome welcome welcome welcome

Source Code: b) Write a program illustrating is Alive and join ()

Implementing isAlive() and join()
AIM: To write a program illustrating isAlive and join ()
SOURCE-CODE:
class A extends Thread
{
public void run()
{
try
{
for(int i=1;i<=10;i++)
{
sleep(1000); System.out.println("good
morning");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class B extends Thread
{
public void run()
{
try
{
for(int j=1;j<=10;j++)
{
sleep(2000); System.out.println("hello");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class C extends Thread
{
public void run()
{
try
{
for(int k=1;k<=10;k++)
{
sleep(3000);
System.out.println("welcome");
}
}
catch(Exception e)
{
System.out.println(e);
}
}
}
class isalivedemo
{
public static void main(String args[])
{
A a1=new A(); B
b1=new B(); C
c1=new C();
a1.start();
b1.start();
c1.start();
System.out.println(a1.isAlive());
System.out.println(b1.isAlive());
System.out.println(c1.isAlive()); try
{
a1.join();
b1.join();
c1.join();
}
catch(InterruptedException e)
{
System.out.println(e);
}
System.out.println(a1.isAlive());
System.out.println(b1.isAlive());
System.out.println(c1.isAlive());
}
}

Output:

true good morning true hello true welcome good morning hello good morning hello hello welcome good morning hello welcome welcome good morning hello hello hello good morning welcome good morning welcome welcome welcome hello welcome good morning false good morning false hello false good morning welcome

Source Code: c) Implementation of Daemon Threads

AIM: To write a program illustrating Daemon Threads
SOURCE-CODE:
class A extends Thread
{
public void run()
{
if(Thread.currentThread().isDaemon())
System.out.println("daemon thread work");else
System.out.println("user thread work");
}
}
class daemondemo
{
public static void main(String[] args)
{
A a1=new A();
A a2=new A();
A a3=new A();
a1.setDaemon(true);
a1.start();
a2.start();
a3.start();
}
}

Output:

daemon thread work user thread work user thread work

Source Code: d) Producer-Consumer problem

AIM: Write a JAVA program Producer Consumer Problem
SOURCE-CODE:
class A
{
int n;
boolean b=false;
synchronized int get()
{
if(!b)
try
{
wait();
}
catch(Exception e)
{
System.out.println(e);
}
System.out.println("Got:"+n);
b=false;
notify();
return n;
}
synchronized void put(int n)
{
if(b)
try
{
wait();
}
catch(Exception e)
{
System.out.println(e);
}
this.n=n;
b=true;
System.out.println("Put:"+n);
notify();
}
}
class producer implements Runnable
{
A a1;
Thread t1;
producer(A a1)
{
this.a1=a1;
t1=new Thread(this);
t1.start();
}
public void run()
{
for(int i=1;i<=10;i++)
{
a1.put(i);
}
}
}
class consumer implements Runnable
{
A a1;
Thread t1;
consumer(A a1)
{
this.a1=a1;
t1=new Thread(this);
t1.start();
}
public void run()
{
for(int j=1;j<=10;j++)
{
a1.get();
}
}
}
class interdemo
{
public static void main(String args[])
{
A a1=new A();
producer p1=new producer(a1);
consumer c1=new consumer(a1);
}
}

Output:

Put:1 Got:1 Put:2 Got:2 Put:3 Got:3 Put:4 Got:4 Put:5 Got:5 Put:6 Got:6 Put:7 Got:7 Put:8 Got:8 Put:9 Got:9 Put:10 Got:10

Source Code: a) Write a java program that connects to a database using JDBC

SOURCE-CODEs:
import java.sql.*;

public class MySQLJDBCExample {
    public static void main(String[] args) {
        // MySQL database URL, username, and password
        String url = "jdbc:mysql://localhost:3306/mysql"; // change to your DB
        String user = "root"; // your MySQL username
        String password = "manager"; // your MySQL password

        // SQL query
        String query = "SELECT * FROM student"; // change to your query

        // Initialize connection, statement, and result set
        Connection conn = null;
        Statement stmt = null;
        ResultSet rs = null;

        try {
            // Step 1: Register the JDBC driver (optional in newer versions)
            // Class.forName("com.mysql.cj.jdbc.Driver");

            // Step 2: Open a connection
            conn = DriverManager.getConnection(url, user, password);

            // Step 3: Create a statement
            stmt = conn.createStatement();

            // Step 4: Execute the query
            rs = stmt.executeQuery(query);

            // Step 5: Process the result set
            while (rs.next()) {
                String roll_no = rs.getString("roll_no"); // Assuming column 'id' exists
                String name = rs.getString("sName"); // Assuming column 'name' exists
                int age=rs.getInt(3);
		System.out.println("roll_no: " + roll_no + ", Name: " + name+" ,Age:"+age);
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            // Step 6: Close the resources
            try {
                if (rs != null) rs.close();
                if (stmt != null) stmt.close();
                if (conn != null) conn.close();
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
    }
}

Output:

roll_no: r001, Name: rahul bose ,Age:23 roll_no: r002, Name: sanjay sahoo ,Age:25 roll_no: r003, Name: sourav ganguly ,Age:26

Source Code: b) Write a java program to connect to a database using JDBC and insert values into it. ()

Implementing isAlive() and join()
AIM: To write a program illustrating isAlive and join ()
SOURCE-CODE:
import java.sql.*;

public class MySQLJDBCExample2 {
    public static void main(String[] args) {
        // MySQL database URL, username, and password
        String url = "jdbc:mysql://localhost:3306/mysql"; // change to your DB
        String user = "root"; // your MySQL username
        String password = "manager"; // your MySQL password

        // SQL query
        String query = "insert into student values ('r004','Raju',28)"; // change to your query

        // Initialize connection, statement, and result set
        Connection conn = null;
        Statement stmt = null;
        ResultSet rs = null;

        try {
            // Step 1: Register the JDBC driver (optional in newer versions)
            // Class.forName("com.mysql.cj.jdbc.Driver");

            // Step 2: Open a connection
            conn = DriverManager.getConnection(url, user, password);

            // Step 3: Create a statement
            stmt = conn.createStatement();

            // Step 4: Execute the query
            int row = stmt.executeUpdate(query);

            // Step 5: Process the result set
          /*  while (rs.next()) {
                String roll_no = rs.getString("roll_no"); // Assuming column 'id' exists
                String name = rs.getString("sName"); // Assuming column 'name' exists
                int age=rs.getInt(3);
		System.out.println("roll_no: " + roll_no + ", Name: " + name+" ,Age:"+age);
            }*/
	if( row==1)
	System.out.println("Successfully Inserted");
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            // Step 6: Close the resources
            try {
                if (rs != null) rs.close();
                if (stmt != null) stmt.close();
                if (conn != null) conn.close();
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
    }
}

Output:

Successfully Inserted

Source Code: c) Write a java program to connect to a database using JDBC and delete values from it

AIM: To write a program illustrating Daemon Threads
SOURCE-CODE:
import java.sql.*;

public class MySQLJDBCExample3 {
    public static void main(String[] args) {
        // MySQL database URL, username, and password
        String url = "jdbc:mysql://localhost:3306/mysql"; // change to your DB
        String user = "root"; // your MySQL username
        String password = "manager"; // your MySQL password

        // SQL query
        String query = "delete from student where roll_no='r004'"; // change to your query

        // Initialize connection, statement, and result set
        Connection conn = null;
        Statement stmt = null;
        ResultSet rs = null;

        try {
            // Step 1: Register the JDBC driver (optional in newer versions)
            // Class.forName("com.mysql.cj.jdbc.Driver");

            // Step 2: Open a connection
            conn = DriverManager.getConnection(url, user, password);

            // Step 3: Create a statement
            stmt = conn.createStatement();

            // Step 4: Execute the query
            int row = stmt.executeUpdate(query);

            // Step 5: Process the result set
          /*  while (rs.next()) {
                String roll_no = rs.getString("roll_no"); // Assuming column 'id' exists
                String name = rs.getString("sName"); // Assuming column 'name' exists
                int age=rs.getInt(3);
		System.out.println("roll_no: " + roll_no + ", Name: " + name+" ,Age:"+age);
            }*/
	if( row==1)
	System.out.println("Successfully Deleted");
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            // Step 6: Close the resources
            try {
                if (rs != null) rs.close();
                if (stmt != null) stmt.close();
                if (conn != null) conn.close();
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
    }
}

Output:

Successfully Deleted

CSE-A@CD LAB

Compiler Design Lab - Experiment Index

Experiments

• 1. Design a Lexical Analyzer
• 2. Implement Lexical Analyzer
• 3. Design Predictive Bottom-up Parser
• 4. Design LALR Parser
• 5. Convert BNF to Yacc
• 6. Generate Machine Code
• 7. Implementation of Symbol Table
• 8. Generate Code for Intermediate Code

/*Experiment 1. Design a Lexical analyzer for the given language. The lexical analyzer should ignore redundant spaces, tabs and new lines. It should also ignore comments. Although the syntax specification states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value.*/ #include(stdio.h> #include(ctype.h> #include(string.h> void keyw(char *p); int i = 0, id = 0, kw = 0, num = 0, op = 0; char keys[32][10] = {"auto", "break", "case", "char", "const", "continue", "default", "do", "double", "else", "enum", "extern", "float", "for", "goto", "if", "int", "long", "register", "return", "short", "signed", "sizeof", "static", "struct", "switch", "typedef", "union", "unsigned", "void", "volatile", "while"}; void main() { char ch, str[25], seps[15] = " \t\n,;(){}[]#\"<>", oper[] = "!%^&*-+=~|.<>/?"; int j; FILE *f1; f1 = fopen("E:/SCET/CDCF/LAB/cd1.txt", "r"); if (f1 == NULL) { printf("Error opening file.\n"); return; } while ((ch = fgetc(f1)) != EOF) { for (j = 0; j <= 14; j++) { if (ch == oper[j]) { printf("%c is an operator\n", ch); op++; str[i] = '\0'; keyw(str); } } for (j = 0; j <= 14; j++) { if (i == -1) break; if (ch == seps[j]) { if (ch == '#') { while ((ch = fgetc(f1)) != '>' && ch != EOF) { printf("%c", ch); } printf("%c is a header file\n", ch); i = -1; break; } else if (ch == '"') { do { ch = fgetc(f1); printf("%c", ch); } while (ch != '"' && ch != EOF); printf("\b is a literal\n"); i = -1; break; } str[i] = '\0'; keyw(str); } } if (i != -1) { str[i] = ch; i++; } else { i = 0; } } fclose(f1); // Close the file printf("Keywords: %d\nIdentifiers: %d\nOperators: %d\nNumbers: %d\n", kw, id, op, num); } void keyw(char *p) { int k, flag = 0; for (k = 0; k <= 31; k++) { if (strcmp(keys[k], p) == 0) { printf("%s is a keyword\n", p); kw++; flag = 1; break; } } if (flag == 0) { if (isdigit(p[0])) { printf("%s is a number\n", p); num++; } else { if (p[0] != '\0') { printf("%s is an identifier\n", p); id++; } } } i = -1; }

/* 2. Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating stools.*/ %{ #include(stdio.h> %} delim [\\t] ws {delim}+ letter [A-Za-z] digit [0-9] id {letter}({letter}|{digit})* num {digit}+(\\.{digit}+)?(E[+|-]?{digit}+)? %% {ws} { printf("no action\\n"); } if|else|then { printf("%s is a keyword\\n", yytext); } {id} { printf("%s is an identifier\\n", yytext); } {num} { printf("it is a number\\n"); } "<" { printf("it is a relational operator less than\\n"); } "<=" { printf("it is a relational operator less than or equal\\n"); } ">" { printf("it is a relational operator greater than\\n"); } ">=" { printf("it is a relational operator greater than or equal\\n"); } "==" { printf("it is a relational operator equal\\n"); } "<>" { printf("it is a relational operator not equal\\n"); } %% int main() { yylex(); return 0; } int yywrap() { return 1; }

/*3. Design Predictive parser for the given language.*/ #include(stdio.h> #include(conio.h> #include(string.h> char prol[7][10] = {"S", "A", "A", "B", "B", "C", "C"}; char pror[7][10] = {"Aa", "Bb", "Cd", "aB", "@", "Cc", "@"}; char prod[7][10] = {"S-->A", "A-->Bb", "A-->Cd", "B-->aB", "B-->@", "C-->Cc", "C-->"}; char first[7][10] = {"abcd", "ab", "cd", "a@", "@", "c@", "@"}; char follow[7][10] = {"$", "$", "$", "a$", "b$", "c$", "d$"}; char table[5][6][10]; int numr(char c) { switch (c) { case 'S': return 0; case 'A': return 1; case 'B': return 2; case 'C': return 3; case 'a': return 0; case 'b': return 1; case 'c': return 2; case 'd': return 3; case '$': return 4; default: return -1; } } void main() { int i, j, k; //clrscr(); // Initialize the table for (i = 0; i < 5; i++) for (j = 0; j < 6; j++) strcpy(table[i][j], " "); printf("\n The following is the predictive parsing table for the following grammar:\n"); for (i = 0; i < 7; i++) printf("%s\n", prod[i]); printf("\n Predictive parsing table is:\n "); fflush(stdin); for (i = 0; i < 7; i++) { k = strlen(first[i]); for (j = 0; j < k; j++) { if (first[i][j] != '@') strcpy(table[numr(prol[i][0]) + 1][numr(first[i][j]) + 1], prod[i]); } } for (i = 0; i < 7; i++) { if (strlen(pror[i]) == 1) { if (pror[i][0] == '@') { k = strlen(follow[i]); for (j = 0; j < k; j++) strcpy(table[numr(prol[i][0]) + 1][numr(follow[i][j]) + 1], prod[i]); } } } strcpy(table[0][0], " "); strcpy(table[0][1], "a"); strcpy(table[0][2], "b"); strcpy(table[0][3], "c"); strcpy(table[0][4], "d"); strcpy(table[0][5], "$"); strcpy(table[1][0], "S"); strcpy(table[2][0], "A"); strcpy(table[3][0], "B"); strcpy(table[4][0], "C"); printf("\n--------------------------------------------------\n"); for (i = 0; i < 5; i++) { for (j = 0; j < 6; j++) { printf("%s\t", table[i][j]); if (j == 5) printf("\n--------------------------------------------\n"); } } getch(); } OUTPUT The following is the predictive parsing table for the following grammar: S-->A A-->Bb A-->Cd B-->aB B-->@ C-->Cc C--> Predictive parsing table is: --------------------------------------------------- a b c d $ --------------------------------------------------- S S-->A S-->A S-->A S-->A --------------------------------------------------- A A-->Bb A-->Bb A-->Cd A-->Cd --------------------------------------------------- B B-->aB B-->@ B-->@ --------------------------------------------------- C C-->Cc C--> C--> ---------------------------------------------------

//Experiment:4 Design LALR bottom-up parser for the given language. 1st we need to reate a lexer program with the exetnstion of .l file lexer.l Program %{ #include(stdio.h> #include "y.tab.h" %} %% [0-9]+ { yylval.dval = atof(yytext); return DIGIT; } \n { return yytext[0]; } . { return yytext[0]; } %% 2nd we need to reate a parser program with the exetnstion of .y file parser.y Program %{ #include(stdio.h> int yylex(void); void yyerror(char *s); %} %union { double dval; } %token (dval> DIGIT %type (dval> expr %type (dval> term %type (dval> factor %% line: expr '\n' { printf("%g\n",$1); } ; expr: expr '+' term { $$ = $1 + $3; } | term ; term: term '*' factor { $$ = $1 * $3; } | factor ; factor: '(' expr ')' { $$ = $2; } | DIGIT ; %% int main() { yyparse(); } void yyerror(char *s) { printf("%s",s); } Sample Output $lex parser.l $yacc –d parser.y $cc lex.yy.c y.tab.c –ll –lm $./a.out 6+3 It Gives 9

// 5.Convert the BNF rules into Yacc form and write code to generate abstract syntax tree // lex file %{ #include"y.tab.h" #include(stdio.h> #include(string.h> int LineNo=1; %} identifier [a-zA-Z][_a-zA-Z0-9]* number [0-9]+|([0-9]*\.[0-9]+) %% main\(\) return MAIN; if return IF; else return ELSE; while return WHILE; int | char | float return TYPE; {identifier} {strcpy(yylval.var,yytext); return VAR;} {number} {strcpy(yylval.var,yytext); return NUM;} \< | \> | \>= | \<= | == {strcpy(yylval.var,yytext); return RELOP;} [ \t] ; \n LineNo++; . return yytext[0]; %% Parser part parser.y %{ #include(string.h> #include(stdio.h> struct quad { char op[5]; char arg1[10]; char arg2[10]; char result[10]; }QUAD[30]; struct stack { int items[100]; int top; }stk; int Index=0,tIndex=0,StNo,Ind,tInd; extern int LineNo; %} %union { char var[10]; } %token NUM VAR RELOP %token MAIN IF ELSE WHILE TYPE %type EXPR ASSIGNMENT CONDITION IFST ELSEST WHILELOOP %left '-' '+' %left '*' '/' %% PROGRAM : MAIN BLOCK ; BLOCK: '{' CODE '}' ; CODE: BLOCK | STATEMENT CODE | STATEMENT ; STATEMENT: DESCT ';' | ASSIGNMENT ';' | CONDST | WHILEST ; DESCT: TYPE VARLIST ; VARLIST: VAR ',' VARLIST | VAR ; ASSIGNMENT: VAR '=' EXPR{ strcpy(QUAD[Index].op,"="); strcpy(QUAD[Index].arg1,$3); strcpy(QUAD[Index].arg2,""); strcpy(QUAD[Index].result,$1); strcpy($$,QUAD[Index++].result); } ; EXPR: EXPR '+' EXPR {AddQuadruple("+",$1,$3,$$);} | EXPR '-' EXPR {AddQuadruple("-",$1,$3,$$);} | EXPR '*' EXPR {AddQuadruple("*",$1,$3,$$);} | EXPR '/' EXPR {AddQuadruple("/",$1,$3,$$);} | '-' EXPR {AddQuadruple("UMIN",$2,"",$$);} | '(' EXPR ')' {strcpy($$,$2);} | VAR | NUM ; CONDST: IFST{ Ind=pop(); sprintf(QUAD[Ind].result,"%d",Index); Ind=pop(); sprintf(QUAD[Ind].result,"%d",Index); } | IFST ELSEST ; IFST: IF '(' CONDITION ')' { strcpy(QUAD[Index].op,"=="); strcpy(QUAD[Index].arg1,$3); strcpy(QUAD[Index].arg2,"FALSE"); strcpy(QUAD[Index].result,"-1"); push(Index); Index++; } BLOCK { strcpy(QUAD[Index].op,"GOTO"); strcpy(QUAD[Index].arg1,""); strcpy(QUAD[Index].arg2,""); strcpy(QUAD[Index].result,"-1"); push(Index); Index++; }; ELSEST: ELSE{ tInd=pop(); Ind=pop(); push(tInd); sprintf(QUAD[Ind].result,"%d",Index); } BLOCK{ Ind=pop(); sprintf(QUAD[Ind].result,"%d",Index); }; CONDITION: VAR RELOP VAR {AddQuadruple($2,$1,$3,$$); StNo=Index-1; } | VAR | NUM ; WHILEST: WHILELOOP{ Ind=pop(); sprintf(QUAD[Ind].result,"%d",StNo); Ind=pop(); sprintf(QUAD[Ind].result,"%d",Index); } ; WHILELOOP: WHILE'('CONDITION ')' { strcpy(QUAD[Index].op,"=="); strcpy(QUAD[Index].arg1,$3); strcpy(QUAD[Index].arg2,"FALSE"); strcpy(QUAD[Index].result,"-1"); push(Index); Index++; } BLOCK { strcpy(QUAD[Index].op,"GOTO"); strcpy(QUAD[Index].arg1,""); strcpy(QUAD[Index].arg2,""); strcpy(QUAD[Index].result,"-1"); push(Index); Index++; } ; %% extern FILE *yyin; int main(int argc,char *argv[]) { FILE *fp; int i; if(argc>1) { fp=fopen(argv[1],"r"); if(!fp) { printf("\n File not found"); exit(0); } yyin=fp; } yyparse(); printf("\n\n\t\t ----------------------------""\n\t\t Pos Operator \tArg1 \tArg2 \tResult" "\n\t\t--------------------"); for(i=0;i$$(Index;i++) { printf("\n\t\t %d\t %s\t %s\t %s\t%s",i,QUAD[i].op,QUAD[i].arg1,QUAD[i].arg2,QUAD[i].result); } printf("\n\t\t -----------------------"); printf("\n\n"); return 0; } void push(int data) { stk.top++; if(stk.top==100) { printf("\n Stack overflow\n"); exit(0); } stk.items[stk.top]=data; } int pop() { int data; if(stk.top==-1) { printf("\n Stack underflow\n"); exit(0); } data=stk.items[stk.top--]; return data; } void AddQuadruple(char op[5],char arg1[10],char arg2[10],char result[10]) { strcpy(QUAD[Index].op,op); strcpy(QUAD[Index].arg1,arg1); strcpy(QUAD[Index].arg2,arg2); sprintf(QUAD[Index].result,"t%d",tIndex++); strcpy(result,QUAD[Index++].result); } yyerror() { printf("\n Error on line no:%d",LineNo); } Creata another c File test.c and place the below content in the file main() { int a,b,c; if(ab) { a=a+b; } if(a<=b) { c=a-b; } else { c=a+b; } } Steps to Execute Step1: lex lexer2.l Step2: yacc -v -d parser.y Step3: gcc lex.yy.c y.tab.c -ll -lm -w Step4: ./a.out test.c Finally it display the its out put as table

Experiment - 6 Write program to generate machine code from the abstract syntax tree generated by the parser. #include(stdio.h> #include(stdlib.h> #include(string.h> int label[20]; int no=0; int main() { FILE *fp1,*fp2; char fname[10],op[10],ch; char operand1[8],operand2[8],result[8]; int i=0,j=0; printf("\n Enter filename of the intermediate code"); scanf("%s",fname); fp1=fopen(fname,"r"); fp2=fopen("target.txt","w"); if(fp1==NULL || fp2==NULL) { printf("\n Error opening the file"); exit(0); } while(!feof(fp1)) { fprintf(fp2,"\n"); fscanf(fp1,"%s",op); i++; if(check_label(i)) fprintf(fp2,"\nlabel#%d",i); if(strcmp(op,"print")==0) { fscanf(fp1,"%s",result); fprintf(fp2,"\n\t OUT %s",result); } if(strcmp(op,"goto")==0) { fscanf(fp1,"%s %s",operand1,operand2); fprintf(fp2,"\n\t JMP %s,label#%s",operand1,operand2); label[no++]=atoi(operand2); } if(strcmp(op,"[]=")==0) { fscanf(fp1,"%s %s %s",operand1,operand2,result); fprintf(fp2,"\n\t STORE %s[%s],%s",operand1,operand2,result); } if(strcmp(op,"uminus")==0) { fscanf(fp1,"%s %s",operand1,result); fprintf(fp2,"\n\t LOAD -%s,R1",operand1); fprintf(fp2,"\n\t STORE R1,%s",result); } switch(op[0]) { case '*': fscanf(fp1,"%s %s %s",operand1,operand2,result); fprintf(fp2,"\n \t LOAD",operand1); fprintf(fp2,"\n \t LOAD %s,R1",operand2); fprintf(fp2,"\n \t MUL R1,R0"); fprintf(fp2,"\n \t STORE R0,%s",result); break; case '+': fscanf(fp1,"%s %s %s",operand1,operand2,result); fprintf(fp2,"\n \t LOAD %s,R0",operand1); fprintf(fp2,"\n \t LOAD %s,R1",operand2); fprintf(fp2,"\n \t ADD R1,R0"); fprintf(fp2,"\n \t STORE R0,%s",result); break; case '-': fscanf(fp1,"%s %s %s",operand1,operand2,result); fprintf(fp2,"\n \t LOAD %s,R0",operand1); fprintf(fp2,"\n \t LOAD %s,R1",operand2); fprintf(fp2,"\n \t SUB R1,R0"); fprintf(fp2,"\n \t STORE R0,%s",result); break; case '/': fscanf(fp1,"%s %s %s",operand1,operand2,result); fprintf(fp2,"\n \t LOAD %s,R0",operand1); fprintf(fp2,"\n \t LOAD %s,R1",operand2); fprintf(fp2,"\n \t DIV R1,R0"); fprintf(fp2,"\n \t STORE R0,%s",result); break; case '%': fscanf(fp1,"%s %s %s",operand1,operand2,result); fprintf(fp2,"\n \t LOAD %s,R0",operand1); fprintf(fp2,"\n \t LOAD %s,R1",operand2); fprintf(fp2,"\n \t DIV R1,R0"); fprintf(fp2,"\n \t STORE R0,%s",result); break; case '=': fscanf(fp1,"%s %s",operand1,result); fprintf(fp2,"\n\t STORE %s %s",operand1,result); break; case '>': j++; fscanf(fp1,"%s %s %s",operand1,operand2,result); fprintf(fp2,"\n \t LOAD %s,R0",operand1); fprintf(fp2,"\n\t JGT %s,label#%s",operand2,result); label[no++]=atoi(result); break; case '<': fscanf(fp1,"%s %s %s",operand1,operand2,result); fprintf(fp2,"\n \t LOAD %s,R0",operand1); fprintf(fp2,"\n\t JLT %s, label#%d",operand2,result); label[no++]=atoi(result); break; } } fclose(fp2); fclose(fp1); fp2=fopen("target.txt","r"); if(fp2==NULL) { printf("Error opening the file\n"); exit(0); } do { ch=fgetc(fp2); printf("%c",ch); }while(ch!=EOF); fclose(fp1); return 0; } int check_label(int k) { int i; for(i=0;i(no ; i++) { if(k==label[i]) return 1; } return 0; }

while ((ch = fgetc(f1)) != EOF) { for (j = 0; j <= 14; j++) { if (ch == oper[j]) { printf("%c is an operator\\n", ch); op++; str[i] = '\\0'; keyw(str); } } }

while ((ch = fgetc(f1)) != EOF) { for (j = 0; j <= 14; j++) { if (ch == oper[j]) { printf("%c is an operator\\n", ch); op++; str[i] = '\\0'; keyw(str); } } }

CD-Lab-Programs

Compiler Design Lab - Experiment Index

Experiments

• 1. Design a Lexical Analyzer
• 2. Implement the Lexical Analyzer

/*Experiment 1. Design a Lexical analyzer for the given language. The lexical analyzer should ignore redundant spaces, tabs and new lines. It should also ignore comments. Although the syntax specification states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value.*/ #include #include #include void keyw(char *p); int i = 0, id = 0, kw = 0, num = 0, op = 0; char keys[32][10] = {"auto", "break", "case", "char", "const", "continue", "default", "do", "double", "else", "enum", "extern", "float", "for", "goto", "if", "int", "long", "register", "return", "short", "signed", "sizeof", "static", "struct", "switch", "typedef", "union", "unsigned", "void", "volatile", "while"}; void main() { char ch, str[25], seps[15] = " \t\n,;(){}[]#\"<>", oper[] = "!%^&*-+=~|.<>/?"; int j; FILE *f1; f1 = fopen("E:/SCET/CDCF/LAB/cd1.txt", "r"); if (f1 == NULL) { printf("Error opening file.\n"); return; } while ((ch = fgetc(f1)) != EOF) { for (j = 0; j <= 14; j++) { if (ch == oper[j]) { printf("%c is an operator\n", ch); op++; str[i] = '\0'; keyw(str); } } for (j = 0; j <= 14; j++) { if (i == -1) break; if (ch == seps[j]) { if (ch == '#') { while ((ch = fgetc(f1)) != '>' && ch != EOF) { printf("%c", ch); } printf("%c is a header file\n", ch); i = -1; break; } else if (ch == '"') { do { ch = fgetc(f1); printf("%c", ch); } while (ch != '"' && ch != EOF); printf("\b is a literal\n"); i = -1; break; } str[i] = '\0'; keyw(str); } } if (i != -1) { str[i] = ch; i++; } else { i = 0; } } fclose(f1); // Close the file printf("Keywords: %d\nIdentifiers: %d\nOperators: %d\nNumbers: %d\n", kw, id, op, num); } void keyw(char *p) { int k, flag = 0; for (k = 0; k <= 31; k++) { if (strcmp(keys[k], p) == 0) { printf("%s is a keyword\n", p); kw++; flag = 1; break; } } if (flag == 0) { if (isdigit(p[0])) { printf("%s is a number\n", p); num++; } else { if (p[0] != '\0') { printf("%s is an identifier\n", p); id++; } } } i = -1; }

%{ #include <stdio.h> %} delim [\\t] ws {delim}+ letter [A-Za-z] digit [0-9] id {letter}({letter}|{digit})* num {digit}+(\\.{digit}+)?(E[+|-]?{digit}+)? %% {ws} { printf("no action\\n"); } if|else|then { printf("%s is a keyword\\n", yytext); } {id} { printf("%s is an identifier\\n", yytext); } {num} { printf("it is a number\\n"); } "<" { printf("it is a relational operator less than\\n"); } "<=" { printf("it is a relational operator less than or equal\\n"); } ">" { printf("it is a relational operator greater than\\n"); } ">=" { printf("it is a relational operator greater than or equal\\n"); } "==" { printf("it is a relational operator equal\\n"); } "<>" { printf("it is a relational operator not equal\\n"); } %% int main() { yylex(); return 0; } int yywrap() { return 1; }

COMPUTER NETWORKS@MINOR DEGREE

Syllabus

UNIT-I: Introduction

Network Hardware and software Reference models- The OSI Reference Model- the TCP/IP Reference Model - A Comparison of the OSI and TCP/IP Reference Models, Examples of Networks: Novell Networks, Arpanet, Internet, Network Topologies WAN, LAN, MAN.

Physical Layer: Guided Transmission Media, Digital Modulation and Multiplexing: frequency division multiplexing, wave length division multiplexing, synchronous time division multiplexing, statistical time division multiplexing.

UNIT-II: The Data Link Layer

Design Issues, Services Provided to the Network Layer – Framing – Error Control – Flow Control, Error Detection and Correction – Error-Correcting Codes – Error Detecting Codes, Elementary Data Link Protocols, Sliding Window Protocols.

Channel allocation methods: TDM, FDM, ALOHA, Carrier sense Multiple access protocols, Collision Free protocols – IEEE standard 802 for LANS – Ethernet, Token Bus, Token ring, Bridges and IEEE 802.11 and 802.16. Data link layer switching, virtual LANs.

UNIT-III: Network layer Routing Algorithms & Internet Working

Network layer Routing Algorithms: Design Issues, Routing Algorithms-Shortest path, Flooding, Flow based Distance vector, Link state, Hierarchical, Broadcast routing, Congestion Control algorithms-General principles of congestion control, Congestion prevention polices, Choke packets, Load shedding, and Jitter Control

Internet Working: Tunnelling, internetworking, Fragmentation, Network layer in the internet – IP protocols, IP address, Subnets, Internet control protocols, OSPF, BGP, Internet multicasting, Mobile IP, IPV6.

UNIT-IV: The Transport Layer & The Internet Transport Protocol

The Transport Layer: Elements of transport protocols – addressing, establishing a connection, releasing connection, flow control and buffering and crash recovery, End to end protocols: UDP, Real Time Tran sport Protocol.

The Internet Transport Protocol: TCP- reliable Byte Stream (TCP) end to end format, segment format, connection establishment and termination, sliding window revisited, adaptive retransmission, TCP extension, Remote Procedure Call.

<

UNIT-V: Application Layer & The Domain Name System

The Transport Layer: Elements of transport protocols – addressing, establishing a connection, releasing connection, flow control and buffering and crash recovery, End to end protocols: UDP, Real Time Tran sport Protocol.

The Domain Name System: The DNS Name Space, Resource Records, Name Servers, Electronic Mail: Architecture and Services, The User Agent, Message Formats, Message Transfer, Final Delivery.

Text Books:

1. Data Communications and Networks – Behrouz A. Forouzan, Third Edition TMH.
2. Computer Networks, 5ed, David Patterson, Elsevier
3. Computer Networks: Andrew S Tanenbaum, 4th Edition. Pearson Education/PHI
4. Computer Networks, Mayank Dave, CENGAGE

References:

1. Tanenbaum and David J Wetherall, Computer Networks, 5th Edition, Pearson Edu,2010
2. Computer Networks: A Top-Down Approach, Behrouz A. Forouzan
3. Firouz Mosharraf, McGraw Hill Education
4. An Engineering Approach to Computer Networks-S.Keshav, 2nd Edition, PearsonEducation
5. Understanding communications and Networks, 3rd Edition, W.A. Shay,Thomson The TCP/IP Guide, by Charles M. Kozierok

Free online Resource:

• The TCP/IP Guide