puteroutput"><span class="identifier">a</span></code>. The second, plus, matches one ore more
        of its subject <code class="computeroutput"><span class="identifier">a</span></code>.
      </p>
<p>
        Unlike EBNF, PEGs have greedy loops. It will match as much as it can until
        its subject fails to match without regard to what follows. The following
        is a classic example of a fairly common EBNF/regex expression failing to
        match in PEG:
      </p>
<pre class="programlisting"><sp