Skip to content

Latest commit

 

History

History
33 lines (24 loc) · 1.05 KB

README.md

File metadata and controls

33 lines (24 loc) · 1.05 KB

Prefix-Postfix Algorithms

This repository contains C++ implementations of Prefix, Postfix, and Infix expression conversion algorithms. These algorithms are fundamental for understanding how expressions are parsed and evaluated in computer science.

Features

  • Prefix to Infix Conversion
  • Postfix to Infix Conversion
  • Evaluation of Postfix Expressions

Installation

Clone this repository to your local machine:

git clone https://github.com/RezaGooner/prefix-postfix-algorithms.git

Then compile and run the C++ code using your preferred IDE or command line:

g++ main.cpp -o expression-converter
./expression-converter

Example Usage

  1. Prefix to Infix: Convert a prefix expression (e.g., + A B) to its infix form (A + B).
  2. Postfix to Infix: Convert a postfix expression (e.g., A B +) to its infix form (A + B).

License

This project is licensed under the Apache-2.0 License.

Feel free to adjust the content to match any specific details or functionality you would like to highlight!