Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Implementation of Parse Tree and CNF (Logic in Comp. Sc.)

Notifications You must be signed in to change notification settings

ankit0905/parseTree

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
7 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Infix To Prefix To Parse Tree Implementation In C

The code covers following parts :

1.) Converting infix propositional logic expression into a prefix propositional logic expression.
2.) Converting prefix expression into a rooted binary parse tree.
3.) Traverse the parse tree in inorder fashion to output the infix expression.
4.) Computing the height of the parse tree.
5.) Evaluating the truth value to the propositional logic formula, given the truth values of each propositional logic atom.
6.) Converting the given logic formula to Conjunctive Normal Form (CNF).
7.) Checking the validity of the formula.

NOTE: Check headers.c for functions and their definitions used.

About

Implementation of Parse Tree and CNF (Logic in Comp. Sc.)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published
Morty Proxy This is a proxified and sanitized view of the page, visit original site.