Path: utzoo!mnetor!tmsoft!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!uunet!world!iecc!compilers-sender
From: croes@imec.be
Newsgroups: comp.compilers
Subject: From type-3 to type-2 grammars
Keywords: parse, theory
Message-ID: <9102012153.AA03777@esat.kuleuven.ac.be>
Date: 1 Feb 91 21:53:52 GMT
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: croes@imec.be
Organization: Compilers Central
Lines: 18
Approved: compilers@iecc.cambridge.ma.us

We are searching for references on methods to convert a type-3 (regular)
grammar into a type-2 (context free) grammar, which is not type-3.

The type-2 grammar may recognize more sentences than the type-3 
grammar, but the number of states in the type-2 grammar must be 
less.

This might seem an unconventional question, but it is really this that
we want.

Tony Claes (claest@imec.be)
Kris Croes (croes@imec.be)
-- 
--------
K. CROES - IMEC - Leuven - Belgium   croes@imec.be
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.