Skip to content

Commit 23123a2

Browse files
authored
Create README.md
1 parent e289743 commit 23123a2

File tree

1 file changed

+33
-0
lines changed

1 file changed

+33
-0
lines changed

README.md

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
2+
---
3+
4+
# Prefix-Postfix Algorithms
5+
6+
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.
7+
8+
## Features
9+
- **Prefix to Infix Conversion**
10+
- **Postfix to Infix Conversion**
11+
- **Evaluation of Postfix Expressions**
12+
13+
## Installation
14+
Clone this repository to your local machine:
15+
```bash
16+
git clone https://github.com/RezaGooner/prefix-postfix-algorithms.git
17+
```
18+
Then compile and run the C++ code using your preferred IDE or command line:
19+
```bash
20+
g++ main.cpp -o expression-converter
21+
./expression-converter
22+
```
23+
24+
## Example Usage
25+
1. **Prefix to Infix**: Convert a prefix expression (e.g., `+ A B`) to its infix form `(A + B)`.
26+
2. **Postfix to Infix**: Convert a postfix expression (e.g., `A B +`) to its infix form `(A + B)`.
27+
28+
## License
29+
This project is licensed under the **Apache-2.0 License**.
30+
31+
---
32+
33+
Feel free to adjust the content to match any specific details or functionality you would like to highlight!

0 commit comments

Comments
 (0)