On page 21 of the b2 document where we are given a sample grammar, it would be nice to discuss or point out regular expressions being used in the parser rules such as the difference between * (match 0 or more times) and + (match 1 or more times). I don’t think this is a problem for those who have experience with regular expressions, but it could be for new users.
hi. my intention at that point was simply to give the reader something to cut and paste to try out. I think most programmers will know with those operators do but it’s not necessary to make it work as a black box. There is a pointer to where the reader will learn about making grammars.
|You must be logged in to comment|