Introduction

---

Convert simple regular expressions to nondeterministic finite automaton.

Supported grammars

• r = (s)
• r = st
• r = s|t
• r = s*
• r = s+
• r = s?
• r = ϵ
  (Copy this character to input if needed)

Examples

• (a|b)*
• (a*|b*)*
• ((ϵ|a)b*)*
• (a|b)*abb(a|b)*