|[8 earlier articles]|
|Re: Compiler project needed email@example.com (Daniel C. Wang) (2000-02-27)|
|Re: Compiler project needed firstname.lastname@example.org (2000-02-27)|
|Re: Compiler project needed email@example.com (Srineet) (2000-02-27)|
|Re: Compiler project needed firstname.lastname@example.org (Franck Pissotte) (2000-02-28)|
|Re: Compiler project needed email@example.com (2000-03-06)|
|Re: Compiler project needed firstname.lastname@example.org (2000-03-06)|
|Re: Compiler project needed email@example.com (Peter Wilson) (2000-03-06)|
|Re: Compiler project needed firstname.lastname@example.org (2000-03-06)|
|Re: Compiler project needed email@example.com (2000-03-06)|
|From:||Peter Wilson <firstname.lastname@example.org>|
|Date:||6 Mar 2000 01:08:06 -0500|
|Organization:||The Boeing Company|
Per Olesen wrote:
> I'm studying computer science on a Danish university and I'm going to
> write a compiler as a project in a course I'm taking.
Here's an idea for a simple project, but it might not be suitable as
it doesn't involve any code generation. However there are a number of
backends that you could consider.
Frontend: Write a parser for Wirth Syntax Notation (an extended BNF
o A pretty printer for a grammar
o Convert a full WSN grammar into a non-extended BNF form; feed this
back into the parser to check it.
o Check if a grammar is LL(N) (with N > 0), reporting constructs that
are not LL(1)
o For a grammar that is LL(N), try to reduce it to LL(n) (n < N)
o Generate language samples from a grammar. Feed these to a parser for
o Generate incorrect language samples from a grammar and feed these to a
parser for the language.
Return to the
Search the comp.compilers archives again.