Queue Stack Reverse Polish Notation Java Exercise - Java Programming Course


Queue Stack Reverse Polish Notation


Create a program that reads a Reverse Polish Notation expression from a text file, for example:

3 4 6 5 - + * 6 +
(Result 21)

Each item will be stored in a queue. Once the queue has all the items stored, you will need to transfer them from the queue to a stack using the Queue and Stack classes provided in java.

Finally, you will operate with the stack to get the correct result of the RPN expression and show it on the console.

 Example Code

package FileTextQueue;
import java.util.*;
public class Main
	public static void main(String[] args)
		System.out.print("Introduce el nombre del archivo: ");
		String nombreFichero = new Scanner(System.in).nextLine();

		if (!(new java.io.File(nombreFichero)).isFile())
			System.out.print("El archivo no existe");

			boolean depurando = true;

			java.io.FileReader ficheroTexto;
		    java.io.BufferedReader ficheroTextoBufferedReader = 
            new java.io.BufferedReader(ficheroTexto);

			ficheroTexto = new java.io.FileReader(nombreFichero);
			String line = " ";

			LinkedList micola = new LinkedList();

				line = ficheroTextoBufferedReader.readLine();
				if (line != null)
			} while (line != null);


			Stack miPila = new Stack();

			int numero1 = 0, numero2 = 0;

			int cantidadCola = micola.size();

			String valorCola;
			String[] valores_linea;

			for (int i = 0; i < cantidadCola; i++)
				valorCola = (String)micola.poll();
				valores_linea = valorCola.split("[ ]", -1);

				for (int c = 0; c < valores_linea.length; c++)
					switch (valores_linea[c])
						case "+":
							numero1 = (int)miPila.pop();
							numero2 = (int)miPila.pop();

							miPila.push(numero2 + numero1);

						case "-":
							numero1 = (int)miPila.pop();
							numero2 = (int)miPila.pop();

							miPila.push(numero2 - numero1);
						case "*":
							numero1 = (int)miPila.pop();
							numero2 = (int)miPila.pop();

							miPila.push(numero2 * numero1);
						case "/":
							numero1 = (int)miPila.pop();
							numero2 = (int)miPila.pop();

							miPila.push(numero2 / numero1);
							// Almacenamos valores enteros

				for (int j = 0; j < miPila.size(); j++)

			if (depurando)
				new Scanner(System.in).nextLine();

		catch (RuntimeException e)
			System.out.println("Error, " + e.getMessage());

More Java Exercises of Dynamic Memory Management

 Implementing a queue using array
Implementing a queue...
 Implementing a stack using array
Implementing a stack...
 Queue Collections
Create a string queue using the Queue class that already exists in the DotNet platform....
Create a string list using the ArrayList class that already exists in the .NET platform. Once created, display all the items stored in the list. In...
 ArrayList duplicate a text file
Create a program that reads from a text file and stores it to another text file by reversing the order of lines. For example, an input text file li...
 Unlimited sum
Create a program to allow the user to enter an unlimited amount of numbers. Also, they can enter the following commands: "sum", to display the sum of...
 ArrayList - Text file reader
provide your basic text file reader here, which displays 21 lines of text and allows the user to navigate using the up and down arrow keys, and exit u...
 Hast Table - Dictionary
Submit your dictionary here using a hash table....
Implement a function to check if a sequence of open and closed parentheses is balanced. In other words, check if each open parenthesis corresponds to ...
 Mix and sort files
Create a program that reads the contents of two different files, merges them, and sorts them alphabetically. For example, if the files contain: "Dog C...
 ArrayList of Points
Create a structure named "Point3D" to represent a point in 3D space with coordinates X, Y, and Z. Create a program that has a menu where the user c...
 Search in file
Create a program that reads a text file, saves its content to an ArrayList, and asks the user to enter sentences to search within the file. The pro...

Juan A. Ripoll - Programming Tutorials and Courses © 2024 All rights reserved.  Legal Conditions.