X-VM-v5-Data: ([nil nil nil nil nil nil nil nil nil] ["779" "Tue" "3" "November" "1998" "13:28:07" "+0100" "Hans Aberg" "haberg@MATEMATIK.SU.SE" nil "16" "Re: Quotes and punctuation" "^Date:" nil nil "11" nil nil nil nil nil] nil) X-POP3-Rcpt: schoepf@polly.zdv.Uni-Mainz.DE Received: from listserv.gmd.de (listserv.gmd.de [192.88.97.1]) by mail.Uni-Mainz.DE (8.8.8/8.8.8) with ESMTP id NAA22514; Tue, 3 Nov 1998 13:29:19 +0100 (MET) Received: from lsv1.listserv.gmd.de (192.88.97.2) by listserv.gmd.de (LSMTP for OpenVMS v1.1a) with SMTP id <9.6ADB591E@listserv.gmd.de>; Tue, 3 Nov 1998 13:29:16 +0100 Received: from RELAY.URZ.UNI-HEIDELBERG.DE by RELAY.URZ.UNI-HEIDELBERG.DE (LISTSERV-TCP/IP release 1.8b) with spool id 407338 for LATEX-L@RELAY.URZ.UNI-HEIDELBERG.DE; Tue, 3 Nov 1998 13:29:08 +0100 Received: from mail0.nada.kth.se (mail0.nada.kth.se [130.237.222.70]) by relay.urz.uni-heidelberg.de (8.8.8/8.8.8) with ESMTP id NAA29529 for ; Tue, 3 Nov 1998 13:28:36 +0100 (MET) Received: from [130.237.37.116] (sl90.modempool.kth.se [130.237.37.116]) by mail0.nada.kth.se (8.8.7/8.8.7) with ESMTP id NAA12091 for ; Tue, 3 Nov 1998 13:28:30 +0100 (MET) X-Sender: su95-hab@mail.nada.kth.se References: <199811030953.JAA04308@nag.co.uk> <98102213123551@man.ac.uk>, <199811030953.JAA04308@nag.co.uk> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Message-ID: Reply-To: Mailing list for the LaTeX3 project In-Reply-To: <13886.60082.618695.290249@fell.open.ac.uk> Date: Tue, 3 Nov 1998 13:28:07 +0100 From: Hans Aberg Sender: Mailing list for the LaTeX3 project To: Multiple recipients of list LATEX-L Subject: Re: Quotes and punctuation Status: R X-Status: X-Keywords: X-UID: 2719 At 12:53 +0100 1998/11/03, Chris Rowley wrote: >By contrast, clever TeX code showing that "TeX can do it" is not so >useful, right now, for this type of parsing problem: since TeX (and >even its expansion mechanism alone) is Turing complete "TeX can do all >parsing and string manipulation". The Turing argument is not so interesting in the context of computer languages, because firstly computers are not Turing machines, and second the equivalence between Turing machines normally do not preserve the other semantic structures that one wants to describe. Hans Aberg * Email: Hans Aberg * Home Page: * AMS member listing: