BNF DEFINITION - help!

banks@iowasp.physics.uiowa.edu
Sun, 11 Sep 1994 23:32:38 GMT

          From comp.compilers
Related articles
BNF DEFINITION - help! banks@iowasp.physics.uiowa.edu (1994-09-11)
Re: BNF DEFINITION - help! eanders+@CMU.EDU (Eric A. Anderson) (1994-09-12)
Re: BNF DEFINITION - help! ellard@bbn.com (1994-09-17)
Re: BNF DEFINITION - help! godau@dec2.wi-inf.uni-essen.de (H.-Juergen Godau) (1994-09-18)
Re: BNF DEFINITION - help! mab@dst17.wdl.loral.com (1994-09-20)
| List of all articles for this month |
Newsgroups: comp.compilers
From: banks@iowasp.physics.uiowa.edu
Keywords: parse, question
Organization: Department of Physics and Astronomy, University of Iowa
Date: Sun, 11 Sep 1994 23:32:38 GMT

I recently had a question asked about BNF definitions for a Programming
Languages Course. The question is as follows:


Using character set C={a,b} write a BNF definition for the language
consisting of all strings with odd length whose first and middle characters are
the same.


If anyone can help it would be greatly appreciated.
e-mail: banks@iowasp.physics.uiowa.edu
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.