http://behalek.cs.vsb.cz/wiki/index.php?action=history&feed=atom&title=FP_Homework_3_extension 2026-04-22T05:20:35Z Revision history for this page on the wiki MediaWiki 1.33.1 http://behalek.cs.vsb.cz/wiki/index.php?title=FP_Homework_3_extension&diff=2049&oldid=prev 2019-11-08T09:02:25Z

<p>Created page with &quot;== Conversion of regular expressions to deterministic finite automaton == * Define a data structure describing regular expressions. * Create a function converting given regul...&quot;</p> <p><b>New page</b></p><div>== Conversion of regular expressions to deterministic finite automaton ==<br /> <br /> * Define a data structure describing regular expressions.<br /> * Create a function converting given regular expression to non-deterministic finite automaton.<br /> * Create a function converting this non-deterministic automaton to its deterministic counterpart.<br /> <br /> == Compute first and follow sets ==<br /> <br /> * Define a representation for context-free grammars.<br /> * Create a function computing non-terminals, which can be rewritten to &#039;epsilon&#039; (empty set).<br /> * Create a function computing the first set for giver sequence of symbols (terminals and non-terminals).<br /> * Create a function computing the follow set for the given non-terminal.<br /> <br /> == Using regular expressions to search in a text ==<br /> <br /> * Define a data structure describing regular expressions.<br /> * Create a function converting given regular expression to non-deterministic finite automaton.<br /> * Run this non-deterministic automaton on a given text to find sub-strings generated by the original regular expression.</div>

Beh01