From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,1cf653444208df72
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-10-10 06:31:35 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!news-FFM2.ecrc.net!news.iks-jena.de!lutz
From: lutz@iks-jena.de (Lutz Donnerhacke)
Newsgroups: comp.lang.ada
Subject: Re: ada vs. cpp
Date: Wed, 10 Oct 2001 13:31:20 +0000 (UTC)
Organization: IKS GmbH Jena
Message-ID: <slrn9s8jd8.4j.lutz@taranis.iks-jena.de>
References: <Xns912FE7C63AC8Dralphworkcoza@196.25.240.158>
 <slrn9rn660.uu.randhol+abuse@kiuk0156.chembio.ntnu.no>
 <Xns912FEBF1DF3EBralphworkcoza@196.25.240.158>
 <tTRu7.25751$S_6.2879078@news20.bellglobal.com>
 <9pgr68$7pu1@news.cis.okstate.edu> <3bbd6287.346843109@news.cis.dfn.de>
 <9pkco7$9qe1@news.cis.okstate.edu> <3bc15a16.1317281@news.cis.dfn.de>
 <9ps9uu$a2g1@news.cis.okstate.edu>
 <3BC2FD54.69BA446D@sparc01.ftw.rsc.raytheon.com>
 <9pv54d$9aa1@news.cis.okstate.edu> <3bc40a3f.4768875@news.cis.dfn.de>
 <slrn9s8bnv.11k.lutz@taranis.iks-jena.de> <9q1e2l05v9@drn.newsguy.com>
NNTP-Posting-Host: taranis.iks-jena.de
X-Trace: branwen.iks-jena.de 1002720680 25506 217.17.192.37 (10 Oct 2001
 13:31:20 GMT)
X-Complaints-To: usenet@iks-jena.de
NNTP-Posting-Date: Wed, 10 Oct 2001 13:31:20 +0000 (UTC)
User-Agent: slrn/0.9.6.3 (Linux)
Xref: archiver1.google.com comp.lang.ada:14147
Date: 2001-10-10T13:31:20+00:00
List-Id: <comp.lang.ada>

* Robert*@ wrote:
>In article <slrn9s8bnv.11k.lutz@taranis.iks-jena.de>, lutz@iks-jena.de says...
>>OTOH C++ source is a type 0 language. Ada source a type 1 language. So
>>they are different.
>
>never heared of type 0 and type 1 languages, must be a new theory,

Not really.

The word problem for type 2 languages can be solved by a finite automaton.
The word problem for type 1 languages can be solved by a finite automaton
with a unlimited stack.
The word problem for type 0 languages can be solved by a finite automaton
with two unlimited stacks (a tape).