[plt-scheme] grammar for regexps

From: David Herman (dherman at ccs.neu.edu)
Date: Thu Jan 8 19:09:27 EST 2004

A small confusion about the grammar for regexps (Ch. 10 of PLT 
MzScheme: Language Manual). It reads that the two productions for the 
Pieces non-terminal are:

     Pieces ::= Piece
             |  PiecePiece

This means there can be exactly one or exactly two pieces. Was this 
supposed to be:

     Pieces ::= Piece
             |  PiecePieces

i.e., a non-empty list of Piece elements? Either I'm missing something 
obvious (quite possible), or this would mean you could only ever match 
(within a particular alternate) a string of either one or two 


Posted on the users mailing list.