y-in-parsing" class="level3">
<h3 class="anchored" data-anchor-id="ambiguity-in-parsing">Ambiguity in Parsing</h3>
<p>An important consideration in parsing with FSAs is ambiguity. A string may have multiple valid parses if the automaton is nondeterministic. In such cases, the parsing algorithm returns the set of all valid parses.</p>
<p>For example, consider an NFA that recognizes the language <span class="math inline">\((a|b)^*a(a|b)^*\)</span>. The string “aba” has multiple valid parses, as the middle