Jump to content

rayp44

New Members
  • Posts

    1
  • Joined

  • Last visited

Profile Information

  • Favorite Area of Science
    Computational and Applied Maths

rayp44's Achievements

Lepton

Lepton (1/13)

0

Reputation

  1. 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
×
×
  • 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.