Related articles |
---|
Looking for compiler term project suggestion onkar.n.m@gmail.com (onkar) (2006-07-25) |
Looking for compiler term project suggestion Ghazanfar_Saeed@mentor.com (Saeed, Ghazanfar) (2006-07-25) |
Re: Looking for compiler term project suggestion pismikrop@gmail.com (=?iso-8859-1?B?cOxzbe1rcvhw?=) (2006-07-25) |
Re: Looking for compiler term project suggestion ang.usenet@gmail.com (Aaron Gray) (2006-07-25) |
Re: Looking for compiler term project suggestion Juergen.Kahrs@vr-web.de (=?ISO-8859-1?Q?J=FCrgen_Kahrs?=) (2006-07-25) |
From: | "Aaron Gray" <ang.usenet@gmail.com> |
Newsgroups: | comp.compilers |
Date: | 25 Jul 2006 17:59:31 -0400 |
Organization: | Compilers Central |
References: | 06-07-074 |
Keywords: | courses, lex |
Posted-Date: | 25 Jul 2006 17:59:31 EDT |
"onkar" <onkar.n.m@gmail.com> wrote in message
> (1) I have great theoretical knowledge of Compiler Theory but never
> implemented a project.
> (2) 2-3 months of time with me.
> (3) Parsing ,Semantic analysis & FSM are my interests.
>
> I am incredibaly good knowledge of Automata Theory.
>
> Given All this and my motivation Please suggest me a Project
Okay, a dynamic LEX. LEX is old technology now and there should be a modern
equivalent availiable.
Basically a library that provides the LEX machine behavour that works on a
DFA or set of DFA's generated by a tool from a set of regular expressions
and character equavalence classes or LEX like file. The LEX tool is also
availiable as a dynamic library component, which can work from a file or an
intermediate set of data structures, which can be generated using the
library.
This should ideally be implemented in an object oriented language, ideally
C++.
Direct DFA from RE generation is prefered. Implementation of beginning and
end of line anchors would be good, but lookahead is not really required.
I do not know whether this would fit in your time scales, but a prototype
should.
Regards,
Aaron
Return to the
comp.compilers page.
Search the
comp.compilers archives again.