Implement Pass-II of two pass assembler for pseudo-machine in Java using object oriented features. The output of assignment-1 (intermediate file and symbol table) should be input for this assignment.

-

 /*

Problem Statement: Implement Pass-II of two pass assembler for pseudo-machine in Java using object oriented

features. The output of assignment-1 (intermediate file and symbol table) should be

input for this assignment.

*/

import java.io.BufferedReader;

import java.io.FileReader;

import java.io.FileWriter;

import java.io.IOException;

import java.util.HashMap;


public class Pass2 {

public static void main(String[] Args) throws IOException{

BufferedReader b1 = new BufferedReader(new FileReader("intermediate.txt"));

     BufferedReader b2 = new BufferedReader(new FileReader("symtab.txt"));

     BufferedReader b3 = new BufferedReader(new FileReader("littab.txt"));

     FileWriter f1 = new FileWriter("Pass2.txt");

     HashMap<Integer, String> symSymbol = new HashMap<Integer, String>();

     HashMap<Integer, String> litSymbol = new HashMap<Integer, String>();

     HashMap<Integer, String> litAddr = new HashMap<Integer, String>();

     String s;

     int symtabPointer=1,littabPointer=1,offset;

     while((s=b2.readLine())!=null){

    String word[]=s.split("\t\t\t");

    symSymbol.put(symtabPointer++,word[1]);

     }

     while((s=b3.readLine())!=null){

    String word[]=s.split("\t\t");

    litSymbol.put(littabPointer,word[0]);

    litAddr.put(littabPointer++,word[1]);

     }

     while((s=b1.readLine())!=null){

    if(s.substring(1,6).compareToIgnoreCase("IS,00")==0){

    f1.write("+ 00 0 000\n");

    }

    else if(s.substring(1,3).compareToIgnoreCase("IS")==0){

    f1.write("+ "+s.substring(4,6)+" ");

    if(s.charAt(9)==')'){

    f1.write(s.charAt(8)+" ");

    offset=3;

    }

    else{

    f1.write("0 ");

    offset=0;

    }

    if(s.charAt(8+offset)=='S')

    f1.write(symSymbol.get(Integer.parseInt(s.substring(10+offset,s.length()-1)))+"\n");

    else

    f1.write(litAddr.get(Integer.parseInt(s.substring(10+offset,s.length()-1)))+"\n");

        } 

    else if(s.substring(1,6).compareToIgnoreCase("DL,01")==0){

    String s1=s.substring(10,s.length()-1),s2="";

    for(int i=0;i<3-s1.length();i++)

    s2+="0";

    s2+=s1;

    f1.write("+ 00 0 "+s2+"\n");

    }

    else{

    f1.write("\n");

    }

     }

     f1.close();

     b1.close();

     b2.close();

     b3.close();

}

}


/*

OUTPUT:

$ javac Pass2.java 

$ java Pass2 

$ cat Pass2.txt


intermediate code - 

(AD,01)(C,200)

(IS,04)(1)(L,1)

(IS,05)(1)(S,1)

(IS,04)(1)(S,1)

(IS,04)(3)(S,3)

(IS,01)(3)(L,2)

(IS,07)(6)(S,4)

(DL,01)(C,5)

(DL,01)(C,1)

(IS,02)(1)(L,3)

(IS,07)(1)(S,5)

(IS,00)

(AD,03)(S,2)+2

(IS,03)(3)(S,3)

(AD,03)(S,6)+1

(DL,02)(C,1)

(DL,02)(C,1)

(AD,02)

(DL,01)(C,1)


Symbol Table --

A 211 1

LOOP 202 1

B 212 1

NEXT 208 1

BACK 202 1

LAST 210 1


literal table --

5 206

1 207

1 213



machine code --


+ 04 1 206

+ 05 1 211

+ 04 1 211

+ 04 3 212

+ 01 3 207

+ 07 6 208

+ 00 0 005

+ 00 0 001

+ 02 1 213

+ 07 1 202

+ 00 0 000

+ 03 3 212     */

Comments

Post a Comment

Popular posts from this blog

Priority Scheduling Algorithm Java Program.

-
import java.util.Scanner; public class priority{ public static void main(String args[]) { Scanner s = new Scanner(System.in); int x,n,p[],pp[],bt[],w[],t[],awt,atat,i; p = new int[10]; pp = new int[10]; bt = new int[10]; w = new int[10]; t = new int[10]; //n is number of process //p is process //pp is process priority //bt is process burst time //w is wait time // t is turnaround time //awt is average waiting time //atat is average turnaround time System.out.print("Enter the number of process : "); n = s.nextInt(); System.out.print("\n\t Enter burst time : time priorities \n"); for(i=0;i<n;i++) { System.out.print("\nProcess["+(i+1)+"]:"); bt[i] = s.nextInt(); pp[i] = s.nextInt(); p[i]=i+1; } //sorting on the basis of priority for(i=0;i<n-1;i++) { for...
Read more

Implement UNIX system calls like ps, fork, join, exec family, and wait for process management (use shell script/ Java/ C programming).

-
//A small example to show how to use execvp() function in C. We will have two .C files , EXEC.c and execDemo.c and we will replace the execDemo.c with EXEC.c by calling execvp() function in execDemo.c . //EXEC.c  #include<stdio.h>  #include<unistd.h>  int main()   {        int i;       printf("This  is EXEC.c, called by execvp() ");        printf("\n");       return 0;   }  Now,create an executable file of EXEC.c using command  gcc EXEC.c -o EXEC //execDemo.c #include<stdio.h> #include<stdlib.h>  #include<unistd.h>  int main()  {     //A null terminated array of character      //pointers       char *args[]={"./EXEC",NULL};       execvp(args[0],args);     /*All statements are ignored after execvp() call as this whole process(execDemo.c) is replaced by ...
Read more

Implement a class CppArray which is identical to a one-dimensional C++ array (i.e., the index set is a set of consecutive integers starting at 0) except for the following : 1. It performs range checking. 2.It allows one to be assigned to another array through the use of assignment operator. 3.It supports a function that returns the size of the array.

-
#include<iostream> #include<math.h> using namespace std; class array {      int a[10],b[10],i,j,temp,n;           public:             void accept();             void display();             void range();             void sort();             void exchange();             int size(); }; void array::accept() {     cout<<"How many Elements you want to insert into the array=\n";     cin>>n;     cout<<"Enter the array Elements=\n";     for(i=0;i<n;i++)        {             cout<<...
Read more