Jump to content

Syntax Trees - Regular Expressions

rayp44
in Computer Science

Featured Replies

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

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

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.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.