Use the attached C program front.c  (compile it – see the instruction for using the c program,) and apply it to   (sum + 47) / total to get the following tokens Next token is: 25 Next lexeme is ( Next token is: 11 Next lexeme is sum Next token is: 21 Next lexeme is + Next token is: 10 Next lexeme is 47 Next token is: 26 Next lexeme is ) Next token is: 24 Next lexeme is / Next token is: 11 Next lexeme is total Next token is: -1 Next lexeme is EOF front.c:

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Use the attached C program front.c  (compile it – see the instruction for using the c program,) and apply it to   (sum + 47) / total to get the following tokens

  • Next token is: 25 Next lexeme is (
  • Next token is: 11 Next lexeme is sum
  • Next token is: 21 Next lexeme is +
  • Next token is: 10 Next lexeme is 47
  • Next token is: 26 Next lexeme is )
  • Next token is: 24 Next lexeme is /
  • Next token is: 11 Next lexeme is total
  • Next token is: -1 Next lexeme is EOF

front.c:

 

 

Expert Solution
Step 1

Code: 

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
*
* @author prmsh
*/
public class Lexical {
public static void main(String args[]) throws FileNotFoundException{
//reading file
Scanner input = new Scanner(new File("C:\\Users\\prmsh\\Documents\\NetBeansProjects\\Chegg\\src\\chegg\\Expression.txt"));
while(input.hasNextLine()) {
//reading next line
String line = input.nextLine();
//reading tokens by space
StringTokenizer strings = new StringTokenizer(line," ");
//reading more strings
while (strings.hasMoreElements()) {
//converting object to string
String token = strings.nextElement().toString();
switch(token) //switch case
{
case "(" :
System.out.println("Next token is: 25 Next lexeme is (");
break;
case ")" :
System.out.println("Next token is: 26 Next lexeme is )");
break;
case "=" :
System.out.println("Next token is: 20 Next lexeme is =");
break;
case "+" :
System.out.println("Next token is: 21 Next lexeme is +");
break;
case "-" :
System.out.println("Next token is: 22 Next lexeme is -");
break;
case "*" :
System.out.println("Next token is: 23 Next lexeme is *");
break;
case "/" :
System.out.println("Next token is: 24 Next lexeme is /");
break;
default :
System.out.println("Next token is: 11 Next lexeme is "+token);
}
}
//finally end of the String
System.out.println("Next token is: -1 Next lexeme is EOF");
}
}
}
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education