ripaltank.com/regularapproaches.html at master · bprollinson/ripaltank.com · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml" lang="en">
  <head>
    <title>RIPAL: Responsive and Intuitive Parsing for the Analysis of Language</title>
    <link href="styles/styles.css" rel="stylesheet" type="text/css" media="all"/>
    <meta name="viewport" content="width=device-width, initial-scale=1"/>
  </head>
  <body>
    <h1>RIPAL: Responsive and Intuitive Parsing for the Analysis of Language</h1>
    <h2>Pages</h2>
    <nav aria-label="Pages">
      <ul>
        <li><a href="index.html">Home</a></li>
        <li><a href="theory.html">Theory</a></li>
        <li><a href="contact.html">Contact</a></li>
      </ul>
    </nav>
    <h2>A comparison of approaches</h2>
    <div class="section">
      <h3>Background</h3>
      <p>Now, we've seen the constructions of regular expressions and finite automata for the purpose of recognizing regular languages.</p>
    </div>
    <div class="section">
      <h3>Comparison</h3>
      <p>The following table illustrates a comparison between approaches:</p>
      <table class="comparisontable">
        <tr>
          <th>Regular expression</th>
          <th>DFA</th>
        </tr>
        <tr>
          <td>Concise to express in written form</td>
          <td>Is best expressed as a diagram, which has an involved construction</td>
        </tr>
        <tr>
          <td>Recognition is hard, as it requires deep inspection and mental trial / error</td>
          <td>Recognition is systematic and fairly straightforward to construct</td>
        </tr>
      </table>
    </div>
    <div class="section">
      <h3>Conclusion</h3>
      <p>Because regular expressions are easier to express in written (string) form, but harder to use directly to recognize strings, we will need some way to convert a regular expression into a finite automaton. We will subsequently show this construction and will also show that DFAs are as expressive as NFAs and &epsilon;-NFAs in terms of the languages they recognize.</p>
    </div>
    <hr/>
    <p>GitHub Repository: <a href="https://github.com/bprollinson/ripal">https://github.com/bprollinson/ripal</a></p>
    <p>Copyright &copy; 2017 Brendan Rollinson-Lorimer</p>
  </body>
</html>