Jump to content

Syntax Trees - Regular Expressions


rayp44
 Share

Recommended Posts

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

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 account

Sign in

Already have an account? Sign in here.

Sign In Now
 Share

×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.