Syntax Trees - Regular Expressions

[rayp44]

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

[khaled]

It's very simple actually, It's known as the RE-NFA Mapping

 

Here are online slides: SlideShare:RE to NFA