Тёмный

AKTU 2017-18 Question on Constructing NFA for Regular Expression using Thompson's Algo | CD | TOC 

Rudra Singh
Подписаться 14 тыс.
Просмотров 9 тыс.
50% 1

Question - Construct the NFA for the Regular Expression a|bb|a*b+ by using Thompson's construction methodology.
AKTU Compiler Design Questions
AKTU Theory of Computation Questions
Thanks for watching this video.
Do like, share & subscribe.

Опубликовано:

 

1 окт 2022

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 2   
@ashiskayal9010
@ashiskayal9010 Год назад
The resultent NFA that you have constructed that accepts b+ but b+ production is not available in the grammar. Please check this
@RudraSingh
@RudraSingh Год назад
Hi, we have a RE a*b+ that is equivalent to b+, ab+, aab+ and so on. So, b+ comes from this RE. Thanks!
Далее
13+ 2 серия
8:17
Просмотров 281 тыс.
Theory of Computation: Construction of CFG - Examples
21:18
Thompson Construction in Compiler Design | Part-5
7:29
Theory of Computation: Conversion of RE to Epsilon-NFA
16:48
TOC Lec 12-Regular Expression to DFA by Deeba kannan
19:28
Problems to Convert RE to Minimized DFA Problem 1
30:46