rayp44 Posted August 31, 2012 Share Posted August 31, 2012 Hi all, I'm having a bit of trouble understanding how to construct binary syntax trees given a regular expression. Specifically, using the steps of the Thompson construction. Any advice or direction to a website that maybe gives a simple example? The regular expression is: a + ba* Much appreciated, Ray Link to comment Share on other sites More sharing options...
khaled Posted September 1, 2012 Share Posted September 1, 2012 It's very simple actually, It's known as the RE-NFA Mapping Here are online slides: SlideShare:RE to NFA Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now