Project description
You need to create a program in Turbo(!!!!)
Using binary trees and recursion
The actual task is:
The input file defines the prefix form of the logical expression , containing single-character names (large Latin letters) of logical operands , operation symbols (small letters n-instead of not, a-instead of and o- instead of or). Develop procedures: 1.P1-checking the correctness of the prefix form recording; 2.P2-conversion of the prefix form into bracket infix; In case of error of the original prefix form, issue an error message.
The source data in prefix form should be read from a file, say, inp.txt; the result in infix form - in the out.txt file.
Important: You need to make a program with intermediate comments (to understand your actions)
Using binary trees and recursion
The actual task is:
The input file defines the prefix form of the logical expression , containing single-character names (large Latin letters) of logical operands , operation symbols (small letters n-instead of not, a-instead of and o- instead of or). Develop procedures: 1.P1-checking the correctness of the prefix form recording; 2.P2-conversion of the prefix form into bracket infix; In case of error of the original prefix form, issue an error message.
The source data in prefix form should be read from a file, say, inp.txt; the result in infix form - in the out.txt file.
Important: You need to make a program with intermediate comments (to understand your actions)
Software development Bank transfer, E-money
