Skip to content
This repository has been archived by the owner on Nov 26, 2022. It is now read-only.

Commit

Permalink
update docs/README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
Lotes committed Apr 15, 2018
1 parent a7f0d83 commit 6f16334
Showing 1 changed file with 0 additions and 7 deletions.
7 changes: 0 additions & 7 deletions docs/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -116,10 +116,6 @@ Great the automata resulting from a regular expression are complete and minimal.

The task now is to transform a text with a set of regular expressions into ordered set of tokens. So, the trivial approach is a for loop over the set of regular expressions until one does match.

```csharp

```

## Further readings
* [Alfred Aho et. al. – Compilers](https://www.amazon.com/Compilers-Principles-Techniques-Tools-2nd/dp/0321486811)
* Wikipedia articles
Expand All @@ -128,6 +124,3 @@ The task now is to transform a text with a set of regular expressions into order
* [DFA minimization](https://en.m.wikipedia.org/wiki/DFA_minimization)
* [Github repository](https://github.com/Lotes/how-to-build-a-lexer)
* [GraphViz](https://www.graphviz.org/) used for generating diagrams

## TODO
* show some interfaces... (code)

0 comments on commit 6f16334

Please sign in to comment.