Example: Success
lSuppose the input string is Òa + b + cÓ.
lSubscripts will indicate the particular instance of the
method and the ÒargumentÓ will indicate
the unparsed remainder of the input. lThe parser calls S1(Òa + b + cÓ).
lS1 calls V1(Òa + b + cÓ).
lV1 identifies a, returns success and unparsed input Ò+ b + cÓ.
lS1 checks for + and finds it; therefore S1 calls S2(Òb + cÓ).
lS2 calls V2(Òb + cÓ).
lV2 identifies b, returns success and unparsed input Ò+ cÓ.
lS2 checks for + and finds it; therefore S2 calls S3(ÒcÓ).
lS3 calls V3(ÒcÓ).
lV3 identifies c, returns success and unparsed input ÒÓ.
lS3 checks for + and does not find it; therefore S3 returns
success with ÒÓ.
lS2 returns success with ÒÓ.
lS1 returns success with ÒÓ.
The
string is accepted.
The
string is accepted.S ¨
V + S | V
V ¨ a | b | c
V ¨ a | b | c