<h1>PREREQUISITES</h1>
<ul>
<li>Understanding of basic Automata Theory concepts.</li>
<li>Deterministic finite automata.</li>
<li>State diagrams for automata.</li>
<li>Regular expressions &amp; languages.</li>
<li>Basic knowledge of any programming language.</li>
</ul>
<h1>INTRODUCTION</h1>
Theory Of Computation also known as Automata Theory is study about abstract machines using discrete mathematics with algorithmic logics. Many who have studied it might have pondered if DFA can be used in constructing syntax grammars. The answer is both “Yes” and “No”. Let’s explore why!
<h1>LIMITATIONS</h1>
<ul>
<li>Not the most efficient option.</li>
<li>Accepts less number of languages.</li>
<li>Time consuming construction.</li>
<li>Inaccuracy to solutions etc.</li>
</ul>
<h1>FUNCTIONS IN PROGRAMMING</h1>
<ul>
<li>The example we are going to use is not the best example, as many might see it could be quite misleading (so I am already warning to not take it literally).</li>
<li>Our example will be constructing a regular language for <code>print()</code> function from Python, but ignoring many aspects.</li>
<li>Don’t take the example literally, I am not telling that’s how Python’s <code>print()</code> function was constructed.</li>
<li>Take it as a way to explore possibilities.</li>
<li>In actual, languages are programmed to have functions which are later abstracted with further code.</li>
<li>So `print()’ is programmed the same way &amp; not how we are going to discuss it as.</li>
<li>But our example serves as forming a basic understanding of this possibility.</li>
</ul>
<h1>EXAMPLE</h1>
<h2>Regular Language</h2>
<pre><code>R = ( *p.r.i.n.t. *( *) *)
</code></pre>
<h2>Explanation</h2>
<ul>
<li>We are not writing anything inside the parenthesis.</li>
<li>There can be any number of spaces before function name.</li>
<li>There can’t be any space between each symbol of function name.</li>
<li>There can be any number of spaces between function name &amp; parenthesis.</li>
<li>There can be any number of spaces between opening &amp; closing of brackets.</li>
<li>There can be any number of spaces after closing of parenthesis.</li>
</ul>
<h2>State Diagram Of Automaton</h2>
<img src="https://media.daily.dev/image/upload/s--HIoNxPhk--/f_auto/v1725987322/ugc/content_9a4c01d3-82db-410c-b32d-4c2a073e1bfe" alt="Screenshot 2024-09-10 222502">
<blockquote>
Note that the self transitions from state q5, q6 and q7 are for spaces as input.
</blockquote>
<h1>FINAL WORDS</h1>
Though DFA are great concepts to explore the world of Automata, but they are certainly not the best ways to construct compilers. When constructing compilers, there are more complex process &amp; theory involved like syntax parsing and lexical units etc. But before delving deep into engineering your own compiler, I would suggest you to become theoretically sound in Discrete Mathematics, Low-Level Programming, Automata Theory &amp; Compiler Design.

Here you can read and post related to embedded systems & system programming along with low-level languages like C, C++, Rust, MASM/TASM, NASM, Arm etc.

System Programming

Theory of Computation, or Automata Theory, investigates abstract machines using discrete mathematics with algorithmic logic. While DFA (Deterministic Finite Automata) can be used to construct syntax grammars in theory, they have limitations in efficiency and the range of languages they can accept. The post uses a simplified example with Python's 'print()' function to illustrate DFA's potential but emphasizes that DFA alone is not sufficient for compiler construction. Greater complexity, including syntax parsing and lexical analysis, is required in actual compiler design.

How compilers can use DFA (Deterministic Finite Automata) in it?

It sure gave me ideas reading this post, so, in that sense it is a useful post for me. Thank you for posting this.