-2

here is the algorithm : I am going through the aho,Ulman reference book on Compiler Construction, which explains the subset construction implementation algorithm for NFA to DFA conversion. The explanation there is very brief. I would like to have a more comprehensive understanding of how this process works at a deeper level. Can anyone please suggest me a good reference or a website that could clear these hard to digest concepts?

RJSD3V
  • 101
  • 1
  • 6
  • 4
    What you are not getting actually? and please show some work that you've done and where you are facing problem? – Faizan Khan Mar 24 '19 at 13:16

2 Answers2

0

Compiler Construction is a great book, but its content is very deep and perhaps difficult to understand (it is designed for a total domain of compilers and many hours are necessary for its total comprension).

Can anyone please suggest me a good reference or a website that could clear these hard to digest concepts?

You should try with Compilers: Principles, Techniques, and Tools.

My first implemententation of NFA to DFA was studying for that book.

ivangalbans
  • 470
  • 5
  • 14
0

This is just a name of an algorithm that's used during compiler design.

When you are designing a language, you design the language's lexical structure deploying a tool known as regular expressions. Regular expressions are declarative though, and act as generators, whereas you need something that can act as a recogniser.

For this to happen, you want to arrive to a "machine" that does that, known as a finite automaton. You can generate a non-deterministic finite automaton from a regular expression using an algorithm known as Thompson's Construction.

The problem with the NFA that you end up with is that it's fairly difficult to emulate programmatically, because of the Non-determinism. For this reason we want to perform another transformation to go from the NFA to a DFA, and that algorithm is known as Subset Construction.

NlightNFotis
  • 9,559
  • 5
  • 43
  • 66