Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.forth > #58987 > unrolled thread
| Started by | lehs <skydda.barnen@gmail.com> |
|---|---|
| First post | 2017-05-10 08:21 -0700 |
| Last post | 2017-05-15 11:23 +0000 |
| Articles | 20 on this page of 215 — 25 participants |
Back to article view | Back to comp.lang.forth
Would ?EXIT work in all ANS-Forth systems? lehs <skydda.barnen@gmail.com> - 2017-05-10 08:21 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-10 16:39 +0100
Re: Would ?EXIT work in all ANS-Forth systems? lehs <skydda.barnen@gmail.com> - 2017-05-10 08:46 -0700
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-10 16:04 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-11 04:22 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-11 10:35 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-11 05:08 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-05-11 03:51 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-11 07:02 -0500
Re: Would ?EXIT work in all ANS-Forth systems? rickman <gnuarm@gmail.com> - 2017-05-13 11:55 -0400
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-15 09:32 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Cecil Bayona <cbayona@cbayona.com> - 2017-05-15 11:56 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-15 12:20 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Cecil Bayona <cbayona@cbayona.com> - 2017-05-15 12:31 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-15 15:50 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-10 16:49 +0000
Re: Would ?EXIT work in all ANS-Forth systems? lehs <skydda.barnen@gmail.com> - 2017-05-10 12:04 -0700
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-11 01:08 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-11 09:13 +0100
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-11 01:48 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-11 09:59 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "Rudy Velthuis" <newsgroups@rvelthuis.de> - 2017-05-12 14:20 +0000
Re: Would ?EXIT work in all ANS-Forth systems? lehs <skydda.barnen@gmail.com> - 2017-05-12 17:01 -0700
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-12 22:18 -0700
Re: Would ?EXIT work in all ANS-Forth systems? lehs <skydda.barnen@gmail.com> - 2017-05-13 03:09 -0700
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-13 21:07 +1000
Re: Would ?EXIT work in all ANS-Forth systems? "Rudy Velthuis" <newsgroups@rvelthuis.de> - 2017-05-13 14:20 +0000
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-14 11:59 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-14 09:21 -0500
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-14 10:43 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-14 18:35 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Lars Brinkhoff <lars.spam@nocrew.org> - 2017-05-15 07:11 +0200
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-15 04:35 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-05-15 03:54 -0700
Re: Would ?EXIT work in all ANS-Forth systems? mhx@iae.nl - 2017-05-15 04:07 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-15 06:23 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-05-15 06:53 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-15 09:18 -0500
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-14 22:44 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-15 04:16 -0500
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-16 02:00 -0700
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-16 02:43 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-16 05:08 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-16 12:11 +0000
Re: Would ?EXIT work in all ANS-Forth systems? NN <november.nihal@gmail.com> - 2017-05-17 05:24 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-17 07:35 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-17 14:59 +0100
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-17 13:30 +0000
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-15 11:09 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Raimond Dragomir <raimond.dragomir@gmail.com> - 2017-05-14 21:17 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Lars Brinkhoff <lars.spam@nocrew.org> - 2017-05-15 07:13 +0200
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-16 10:24 +1000
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-16 01:13 -0700
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-16 12:26 +0000
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-17 01:58 -0700
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-17 16:45 +0000
Re: Would ?EXIT work in all ANS-Forth systems? obi65537@gmail.com - 2017-05-25 12:04 -0700
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-26 10:02 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-26 07:46 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-26 13:53 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-26 10:14 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Cecil Bayona <cbayona@cbayona.com> - 2017-05-26 10:16 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Raimond Dragomir <raimond.dragomir@gmail.com> - 2017-05-26 08:59 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Cecil Bayona <cbayona@cbayona.com> - 2017-05-26 11:27 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Raimond Dragomir <raimond.dragomir@gmail.com> - 2017-05-26 10:19 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Lars Brinkhoff <lars.spam@nocrew.org> - 2017-05-26 20:20 +0200
Re: Would ?EXIT work in all ANS-Forth systems? Raimond Dragomir <raimond.dragomir@gmail.com> - 2017-05-26 21:38 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Cecil Bayona <cbayona@cbayona.com> - 2017-05-26 14:06 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Raimond Dragomir <raimond.dragomir@gmail.com> - 2017-05-26 22:00 -0700
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-26 17:06 +0000
Re: Would ?EXIT work in all ANS-Forth systems? hum9 <obi65537@gmail.com> - 2017-05-27 01:15 -0700
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-28 14:17 +0000
Re: Would ?EXIT work in all ANS-Forth systems? obi65537@gmail.com - 2017-05-29 20:30 -0700
Re: Would ?EXIT work in all ANS-Forth systems? hum9 <obi65537@gmail.com> - 2017-05-29 21:08 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-30 04:12 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-30 12:44 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-30 08:09 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-30 14:35 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-30 16:27 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-31 12:16 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-06-01 05:34 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-06-01 02:14 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-06-01 08:40 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-06-01 06:14 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-01 13:16 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-06-01 07:43 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-01 14:15 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-02 11:49 +0100
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-06-01 16:42 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-06-02 03:19 -0500
Re: Would ?EXIT work in all ANS-Forth systems? hughaguilar96@gmail.com - 2017-06-01 14:07 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Matthias Trute <matthias.trute@gmail.com> - 2017-06-02 12:26 -0700
Re: Would ?EXIT work in all ANS-Forth systems? minforth@arcor.de - 2017-06-02 13:16 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Matthias Trute <matthias.trute@gmail.com> - 2017-06-03 01:34 -0700
Re: Would ?EXIT work in all ANS-Forth systems? minforth@arcor.de - 2017-06-03 02:54 -0700
Re: Would ?EXIT work in all ANS-Forth systems? hughaguilar96@gmail.com - 2017-06-01 13:53 -0700
Re: Would ?EXIT work in all ANS-Forth systems? hughaguilar96@gmail.com - 2017-06-01 13:48 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-01 22:31 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-06-02 08:03 -0500
Re: Would ?EXIT work in all ANS-Forth systems? albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-06-02 15:16 +0200
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-02 14:30 +0100
Re: Would ?EXIT work in all ANS-Forth systems? hughaguilar96@gmail.com - 2017-06-02 07:32 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-02 18:23 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-06-01 14:49 -0700
Re: Would ?EXIT work in all ANS-Forth systems? minforth@arcor.de - 2017-06-01 16:05 -0700
Re: Would ?EXIT work in all ANS-Forth systems? hughaguilar96@gmail.com - 2017-06-01 17:48 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-06-01 18:44 -0700
Re: Would ?EXIT work in all ANS-Forth systems? hughaguilar96@gmail.com - 2017-06-01 19:14 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-06-01 19:54 -0700
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-27 17:40 +0000
WRAP...END-WRAP (was: Would ?EXIT work ...) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-30 15:28 +0000
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-24 15:46 +1000
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <obi65537@gmail.com> - 2017-05-25 11:51 -0700
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <obi65537@gmail.com> - 2017-05-25 20:38 -0700
Re: Would ?EXIT work in all ANS-Forth systems? obi65537@gmail.com - 2017-05-25 22:03 -0700
Re: Would ?EXIT work in all ANS-Forth systems? obi65537@gmail.com - 2017-05-25 22:09 -0700
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-26 21:56 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-26 13:30 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-27 15:04 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-27 17:33 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-29 12:17 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-29 08:42 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-30 11:14 +1000
Re: Would ?EXIT work in all ANS-Forth systems? obi65537@gmail.com - 2017-05-29 20:32 -0700
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-30 14:40 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-30 12:55 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-31 12:17 +1000
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-01 12:01 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-06-01 02:17 -0500
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-01 22:09 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-06-01 07:51 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-01 14:20 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-02 13:09 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-02 08:44 +0100
Re: Would ?EXIT work in all ANS-Forth systems? obi65537@gmail.com - 2017-06-02 11:05 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-02 19:34 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-03 14:29 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-06-02 21:54 -0700
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-04 22:52 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-06-02 22:24 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Gerry Jackson <gerry@jackson9000.fsnet.co.uk> - 2017-06-03 07:34 +0100
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-06-03 08:39 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Gerry Jackson <gerry@jackson9000.fsnet.co.uk> - 2017-06-03 13:47 +0100
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-06-03 14:36 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Gerry Jackson <gerry@jackson9000.fsnet.co.uk> - 2017-06-04 17:29 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-04 10:28 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-05 15:09 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-05 09:36 +0100
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-06-05 09:35 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-05 10:57 +0100
Re: Would ?EXIT work in all ANS-Forth systems? JennyB <jennybrien@googlemail.com> - 2017-06-05 13:07 -0700
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-07 12:42 +1000
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-05 20:07 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-06-04 10:45 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-05 19:21 +1000
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-06-03 14:19 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-06-02 03:32 -0500
Re: Would ?EXIT work in all ANS-Forth systems? hughaguilar96@gmail.com - 2017-06-02 06:50 -0700
Re: Would ?EXIT work in all ANS-Forth systems? hum9 <obi65537@gmail.com> - 2017-05-27 00:33 -0700
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-27 14:53 +1000
READ-FILE over-specified? "HAA" <someone@microsoft.com> - 2017-05-27 21:28 +1000
Re: READ-FILE over-specified? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-27 13:11 +0000
Re: READ-FILE over-specified? "HAA" <someone@microsoft.com> - 2017-05-29 13:47 +1000
Re: READ-FILE over-specified? hughaguilar96@gmail.com - 2017-05-28 21:58 -0700
Re: READ-FILE over-specified? "HAA" <someone@microsoft.com> - 2017-05-30 11:06 +1000
Re: READ-FILE over-specified? albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-05-28 09:44 +0200
Re: READ-FILE over-specified? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-28 13:41 +0000
Re: READ-FILE over-specified? albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-05-28 19:59 +0200
Re: READ-FILE over-specified? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-29 05:20 +0000
Re: READ-FILE over-specified? albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-05-29 10:29 +0200
Re: READ-FILE over-specified? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-29 09:34 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Gerry Jackson <gerry@jackson9000.fsnet.co.uk> - 2017-05-16 09:42 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-16 09:53 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-16 04:53 -0500
Re: Would ?EXIT work in all ANS-Forth systems? albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-05-16 12:32 +0200
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-16 12:35 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-16 10:48 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-16 18:23 +0100
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-17 04:33 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-17 12:29 +0100
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-16 10:28 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-16 10:43 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-16 16:34 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-16 12:41 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-17 16:14 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-18 03:05 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-18 16:33 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-18 12:43 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-18 04:01 -0500
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-18 15:41 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Andrew Haley <andrew29@littlepinkcloud.invalid> - 2017-05-18 11:58 -0500
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-18 22:57 +0100
Re: Would ?EXIT work in all ANS-Forth systems? "HAA" <someone@microsoft.com> - 2017-05-17 00:32 +1000
Re: Would ?EXIT work in all ANS-Forth systems? Alex <alex@rivadpm.com> - 2017-05-16 15:53 +0100
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-15 05:29 +0000
Re: Would ?EXIT work in all ANS-Forth systems? humptydumpty <ouatubi@gmail.com> - 2017-05-14 23:00 -0700
Re: Would ?EXIT work in all ANS-Forth systems? rickman <gnuarm@gmail.com> - 2017-05-17 12:27 -0400
Re: Would ?EXIT work in all ANS-Forth systems? "Rudy Velthuis" <newsgroups@rvelthuis.de> - 2017-05-15 09:16 +0000
Re: Would ?EXIT work in all ANS-Forth systems? "Rudy Velthuis" <newsgroups@rvelthuis.de> - 2017-05-15 09:55 +0000
Re: Would ?EXIT work in all ANS-Forth systems? "Rudy Velthuis" <newsgroups@rvelthuis.de> - 2017-05-13 14:25 +0000
Re: Would ?EXIT work in all ANS-Forth systems? Julian Fondren <julian.fondren@gmail.com> - 2017-05-13 07:49 -0700
Re: Would ?EXIT work in all ANS-Forth systems? "Rudy Velthuis" <newsgroups@rvelthuis.de> - 2017-05-15 09:59 +0000
Re: Would ?EXIT work in all ANS-Forth systems? "Rudy Velthuis" <newsgroups@rvelthuis.de> - 2017-05-15 12:22 +0000
Re: Would ?EXIT work in all ANS-Forth systems? "Rudy Velthuis" <newsgroups@rvelthuis.de> - 2017-05-13 14:19 +0000
Re: Would ?EXIT work in all ANS-Forth systems? lehs <skydda.barnen@gmail.com> - 2017-05-14 23:23 -0700
Re: Would ?EXIT work in all ANS-Forth systems? Raimond Dragomir <raimond.dragomir@gmail.com> - 2017-05-15 00:10 -0700
Re: Would ?EXIT work in all ANS-Forth systems? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-15 09:35 +0000
Re: Would ?EXIT work in all ANS-Forth systems? lehs <skydda.barnen@gmail.com> - 2017-05-15 00:54 -0700
Return-address manipulation (was: Would ?EXIT ...) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-15 08:47 +0000
Re: Return-address manipulation (was: Would ?EXIT ...) stephen@mpeforth.com (Stephen Pelc) - 2017-05-15 11:53 +0000
Re: Return-address manipulation (was: Would ?EXIT ...) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-05-16 13:03 +0000
Re: Return-address manipulation (was: Would ?EXIT ...) Raimond Dragomir <raimond.dragomir@gmail.com> - 2017-05-16 07:06 -0700
Re: Return-address manipulation (was: Would ?EXIT ...) Raimond Dragomir <raimond.dragomir@gmail.com> - 2017-05-16 07:14 -0700
Re: Would ?EXIT work in all ANS-Forth systems? "Elizabeth D. Rather" <erather@forth.com> - 2017-05-14 21:58 -1000
Re: Would ?EXIT work in all ANS-Forth systems? stephen@mpeforth.com (Stephen Pelc) - 2017-05-15 11:23 +0000
Page 5 of 11 — ← Prev page 1 … 3 4 [5] 6 7 … 11 Next page →
| From | anton@mips.complang.tuwien.ac.at (Anton Ertl) |
|---|---|
| Date | 2017-06-01 05:34 +0000 |
| Message-ID | <2017Jun1.073420@mips.complang.tuwien.ac.at> |
| In reply to | #60110 |
Andrew Haley <andrew29@littlepinkcloud.invalid> writes:
>Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote:
>> Recognizers are more like scanners than parsers in Algol-family
>> languages,
>
>Really?
Yes, really!
> Surely if you've got a recursive bunch of recognizers you've
>got a recursive-decent parser.
The power you can exert at a recognizer is the full power of Forth.
You can have a recognizer that recognizer A^nB^nC^n; try that with a
recursive-descent parser. My point is about the role it plays in the
language, not about the (lack of) power of the mechanism. Recognizers
deal with a single word. For the stuff where Algol uses the parser,
Forth uses the text interpreter and things like orig and dest.
>And if they're throwing exceptions,
>catching, and retrying, you've got a recursive descent parser with
>backtracking.
Why are you introducing "retrying" into the discussion? Did you read
what Alex is using THROW for?
- anton
--
M. Anton Ertl http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
New standard: http://www.forth200x.org/forth200x.html
EuroForth 2017: http://www.euroforth.org/ef17/
[toc] | [prev] | [next] | [standalone]
| From | Andrew Haley <andrew29@littlepinkcloud.invalid> |
|---|---|
| Date | 2017-06-01 02:14 -0500 |
| Message-ID | <nJKdnSNMfqRZI7LEnZ2dnUU7-cHNnZ2d@supernews.com> |
| In reply to | #60125 |
Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote: > Andrew Haley <andrew29@littlepinkcloud.invalid> writes: >>Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote: >>> Recognizers are more like scanners than parsers in Algol-family >>> languages, >> >>Really? > > Yes, really! > >>Surely if you've got a recursive bunch of recognizers you've >>got a recursive-decent parser. > > The power you can exert at a recognizer is the full power of Forth. > You can have a recognizer that recognizer A^nB^nC^n; try that with a > recursive-descent parser. Whoever said that using recognizers was *limited* to a recursive- descent parser? It is *at least* that. > My point is about the role it plays in the language, not about the > (lack of) power of the mechanism. Recognizers deal with a single > word. What does this last sentence mean? Recognizers aren't limited to a single word. > For the stuff where Algol uses the parser, Forth uses the > text interpreter and things like orig and dest. > >>And if they're throwing exceptions, catching, and retrying, you've >>got a recursive descent parser with backtracking. > > Why are you introducing "retrying" into the discussion? Did you read > what Alex is using THROW for? He said: > Sometimes it's not possible to avoid, even with factoring; returning > to the caller (even a single level return) may have multiple DROPs > and R> DROPs just to get the stack back to anything sensible. The > recognizer proposal is one example where recognizers, especially > when nested, may require levels of effort to unwind stacks that make > the code exceedingly complex to follow and would undoubtedly score > zero style points in review. I assume that if stacks are being unwound there is an intent to continue parsing the input. And presumably it's because something failed, otherwise you'd just return, popping stuff in the reverse order you pushed it. Andrew.
[toc] | [prev] | [next] | [standalone]
| From | anton@mips.complang.tuwien.ac.at (Anton Ertl) |
|---|---|
| Date | 2017-06-01 08:40 +0000 |
| Message-ID | <2017Jun1.104022@mips.complang.tuwien.ac.at> |
| In reply to | #60129 |
Andrew Haley <andrew29@littlepinkcloud.invalid> writes:
>Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote:
>> My point is about the role it plays in the language, not about the
>> (lack of) power of the mechanism. Recognizers deal with a single
>> word.
>
>What does this last sentence mean? Recognizers aren't limited to a
>single word.
Recognizers are passed a string parsed by WORD or PARSE-NAME, and
typically that's all they look at. One exception is the string
recognizer, but if you look at Algol languages, strings are also
handled by the scanner there. So recognizers really play the role
that scanners play for Algol-style languages.
Can you venture outside this intended application area of recognizers?
Sure, after all, this is Forth, not a nanny language.
So if you want to write a C parser and use the recognizer mechanism to
invoke it, there is nothing to stop you. But recognizers are not
necessary for this kind of stuff: Chuck Moore wrote his BASIC
interpreter without recognizers, Julian Noble wrote his Formula
Translator without recognizers, and IIRC you presented something along
these lines at EuroForth some years ago, too. So recognizers are not
necessary for this kind of stuff. They also don't provide support
that makes this kind of usage any easier.
>He said:
>
>> Sometimes it's not possible to avoid, even with factoring; returning
>> to the caller (even a single level return) may have multiple DROPs
>> and R> DROPs just to get the stack back to anything sensible. The
>> recognizer proposal is one example where recognizers, especially
>> when nested, may require levels of effort to unwind stacks that make
>> the code exceedingly complex to follow and would undoubtedly score
>> zero style points in review.
>
>I assume that if stacks are being unwound there is an intent to
>continue parsing the input. And presumably it's because something
>failed,
Sure, when a recognizer fails, the next is tried, if there is one, but
that is outside the individual recognizers. That does not make it a
backtracking recursive descent parser in the usual sense, because, for
every failure you progress in the recognizer stack, and when the last
recognizer fails, it's over. By contrast, in a backtracking recursive
descent parser, there can be (and often is) some nesting level further
out from the fail-retry at hand.
Of course, nothing prevents you from writing a backtracking recursive
descent parser and putting it in a recognizer (see above), but again,
this is not the intended use and there is no particular support for it
there.
- anton
--
M. Anton Ertl http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
New standard: http://www.forth200x.org/forth200x.html
EuroForth 2017: http://www.euroforth.org/ef17/
[toc] | [prev] | [next] | [standalone]
| From | Andrew Haley <andrew29@littlepinkcloud.invalid> |
|---|---|
| Date | 2017-06-01 06:14 -0500 |
| Message-ID | <eeKdnelR2uBka7LEnZ2dnUU7-R_NnZ2d@supernews.com> |
| In reply to | #60133 |
Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote: > Andrew Haley <andrew29@littlepinkcloud.invalid> writes: >>Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote: >>> My point is about the role it plays in the language, not about the >>> (lack of) power of the mechanism. Recognizers deal with a single >>> word. >> >>What does this last sentence mean? Recognizers aren't limited to a >>single word. > > Recognizers are passed a string parsed by WORD or PARSE-NAME, and > typically that's all they look at. One exception is the string > recognizer, but if you look at Algol languages, strings are also > handled by the scanner there. So recognizers really play the role > that scanners play for Algol-style languages. > >>He said: >> >>> Sometimes it's not possible to avoid, even with factoring; returning >>> to the caller (even a single level return) may have multiple DROPs >>> and R> DROPs just to get the stack back to anything sensible. The >>> recognizer proposal is one example where recognizers, especially >>> when nested, may require levels of effort to unwind stacks that make >>> the code exceedingly complex to follow and would undoubtedly score >>> zero style points in review. >> >>I assume that if stacks are being unwound there is an intent to >>continue parsing the input. And presumably it's because something >>failed, > > Sure, when a recognizer fails, the next is tried, if there is one, but > that is outside the individual recognizers. That does not make it a > backtracking recursive descent parser in the usual sense, because, for > every failure you progress in the recognizer stack, and when the last > recognizer fails, it's over. But... if exiting a recognizer with "not found" is all you want to do, why on Earth would you want to unwind the stacks? If a recognizer fails to recognize something then all it has to do is drop whatever it pushed and return. There's no need to throw an exception unless you want to do something more complicated than simply return a failure to recognize. Failure to recognize is not an exceptional condition: I'd expect it to happen more often than success. It's the normal case. Unless this is for the "too damn lazy to DROP the stuff I put on the stack" crowd, in which case I really don't care. (Having said all of that the use of exceptions to implement LOCATE by throwing to remove whatever a recognizer pushed makes sense, I get that.) Andrew.
[toc] | [prev] | [next] | [standalone]
| From | Alex <alex@rivadpm.com> |
|---|---|
| Date | 2017-06-01 13:16 +0100 |
| Message-ID | <ogp0cs$oev$1@dont-email.me> |
| In reply to | #60138 |
On 6/1/2017 12:14, Andrew Haley wrote: > > But... if exiting a recognizer with "not found" is all you want to do, > why on Earth would you want to unwind the stacks? If a recognizer > fails to recognize something then all it has to do is drop whatever it > pushed and return. AKA unwinding the stacks. > There's no need to throw an exception unless you There's that damned word exception again. > want to do something more complicated than simply return a failure to > recognize. Failure to recognize is not an exceptional condition: I'd > expect it to happen more often than success. It's the normal case. No, I don't agree. The first recognizer searches for a name, and it is the usual case that it is found during the search. Failure there and then moving on to numbers is a much smaller frequency. > > Unless this is for the "too damn lazy to DROP the stuff I put on the > stack" crowd, in which case I really don't care. It's about too many style points being lost while tidying up the stack, and clarity for the reader. > > (Having said all of that the use of exceptions to implement LOCATE by > throwing to remove whatever a recognizer pushed makes sense, I get > that.) That's a sure fire indicator that there's something wrong with the concept of treating CATCH/THROW as something exceptional. It need not be. It is also possible to write a recognizer driver that works for both the traditional sort-out-the-stack approach and why-not-just-THROW without huge overhead, which is implemented in WF32. -- Alex
[toc] | [prev] | [next] | [standalone]
| From | Andrew Haley <andrew29@littlepinkcloud.invalid> |
|---|---|
| Date | 2017-06-01 07:43 -0500 |
| Message-ID | <mI2dnfbQiYKQka3EnZ2dnUU7-UnNnZ2d@supernews.com> |
| In reply to | #60140 |
Alex <alex@rivadpm.com> wrote: > On 6/1/2017 12:14, Andrew Haley wrote: > >> >> But... if exiting a recognizer with "not found" is all you want to do, >> why on Earth would you want to unwind the stacks? If a recognizer >> fails to recognize something then all it has to do is drop whatever it >> pushed and return. > > AKA unwinding the stacks. No, that's not "unwinding the stacks": it's just the usual Forth DROPping on exit, which you don't usually have to do very much because words usually consume their arguments, but is occasionally necessary. >> There's no need to throw an exception unless you > > There's that damned word exception again. :-) Well, it is the exception word set: that is what it is for, after all. >> want to do something more complicated than simply return a failure to >> recognize. Failure to recognize is not an exceptional condition: I'd >> expect it to happen more often than success. It's the normal case. > > No, I don't agree. The first recognizer searches for a name, and it is > the usual case that it is found during the search. Failure there and > then moving on to numbers is a much smaller frequency. Indeed, sure. But that's just the normal dictionary lookup, and (as we've been told many, many times) there are a lot more possible recognizers than that. >> Unless this is for the "too damn lazy to DROP the stuff I put on the >> stack" crowd, in which case I really don't care. > > It's about too many style points being lost while tidying up the stack, > and clarity for the reader. I'll take that as a "yes", then. >> (Having said all of that the use of exceptions to implement LOCATE by >> throwing to remove whatever a recognizer pushed makes sense, I get >> that.) > > That's a sure fire indicator that there's something wrong with the > concept of treating CATCH/THROW as something exceptional. It need > not be. Not exactly, no. This tells me not that there is something wrong with the concept of treating CATCH/THROW as something exceptional, but that if you need something so heavyweight to handle LOCATE with recognizers, the recognizer proposal must be broken. But apparently it isn't necessary, anyway. I have tried not treating CATCH/THROW as something exceptional, and it didn't end well for me. The resulting code was hard to follow and nearly impossible to debug. This led me to believe that the exception wordset should be left to do what it is good at. And it's *really* good for that. > It is also possible to write a recognizer driver that works for both > the traditional sort-out-the-stack approach and why-not-just-THROW > without huge overhead, which is implemented in WF32. OK, I must have a look. Andrew.
[toc] | [prev] | [next] | [standalone]
| From | Alex <alex@rivadpm.com> |
|---|---|
| Date | 2017-06-01 14:15 +0100 |
| Message-ID | <ogp3r3$54d$1@dont-email.me> |
| In reply to | #60141 |
On 6/1/2017 13:43, Andrew Haley wrote:
> Alex <alex@rivadpm.com> wrote:
>> On 6/1/2017 12:14, Andrew Haley wrote:
>>
>>>
>>> But... if exiting a recognizer with "not found" is all you want to do,
>>> why on Earth would you want to unwind the stacks? If a recognizer
>>> fails to recognize something then all it has to do is drop whatever it
>>> pushed and return.
>>
>> AKA unwinding the stacks.
>
> No, that's not "unwinding the stacks": it's just the usual Forth
> DROPping on exit, which you don't usually have to do very much because
> words usually consume their arguments, but is occasionally necessary.
>
>>> There's no need to throw an exception unless you
>>
>> There's that damned word exception again.
>
> :-)
>
> Well, it is the exception word set: that is what it is for, after all.
>
>>> want to do something more complicated than simply return a failure to
>>> recognize. Failure to recognize is not an exceptional condition: I'd
>>> expect it to happen more often than success. It's the normal case.
>>
>> No, I don't agree. The first recognizer searches for a name, and it is
>> the usual case that it is found during the search. Failure there and
>> then moving on to numbers is a much smaller frequency.
>
> Indeed, sure. But that's just the normal dictionary lookup, and (as
> we've been told many, many times) there are a lot more possible
> recognizers than that.
>
>>> Unless this is for the "too damn lazy to DROP the stuff I put on the
>>> stack" crowd, in which case I really don't care.
>>
>> It's about too many style points being lost while tidying up the stack,
>> and clarity for the reader.
>
> I'll take that as a "yes", then.
>
>>> (Having said all of that the use of exceptions to implement LOCATE by
>>> throwing to remove whatever a recognizer pushed makes sense, I get
>>> that.)
>>
>> That's a sure fire indicator that there's something wrong with the
>> concept of treating CATCH/THROW as something exceptional. It need
>> not be.
>
> Not exactly, no. This tells me not that there is something wrong with
> the concept of treating CATCH/THROW as something exceptional, but that
> if you need something so heavyweight to handle LOCATE with
> recognizers, the recognizer proposal must be broken. But apparently
> it isn't necessary, anyway.
>
> I have tried not treating CATCH/THROW as something exceptional, and it
> didn't end well for me. The resulting code was hard to follow and
> nearly impossible to debug. This led me to believe that the exception
> wordset should be left to do what it is good at. And it's *really*
> good for that.
>
>> It is also possible to write a recognizer driver that works for both
>> the traditional sort-out-the-stack approach and why-not-just-THROW
>> without huge overhead, which is implemented in WF32.
>
> OK, I must have a look.
THROW_UNDEFINED is -13. I'm reworking it from a ?DO loop to BEGIN etc as
it's a little messy. A stack is structured as < count=n 1 2 .. n > cells.
: recognize ( addr len stack-id -- i*x dt:type | dt:null )
\ apply a recognizer stack to a string, delivering a token
dup cell+ swap @ cells bounds ?do
2dup i -rot 2>r \ not "2dup 2>r i"
@ catch throw_undefined over = if
3drop \ not found
else
throw \ re-throw if not zero
dup dt:null <> if
2rdrop unloop exit \ otherwise found
then
drop \ drop DT:NULL
then
2r> \ recover string
cell +loop
2drop dt:null ; \ exhausted stack
>
> Andrew.
>
--
Alex
[toc] | [prev] | [next] | [standalone]
| From | Alex <alex@rivadpm.com> |
|---|---|
| Date | 2017-06-02 11:49 +0100 |
| Message-ID | <ogrfl7$u0v$1@dont-email.me> |
| In reply to | #60143 |
On 6/1/2017 14:15, Alex wrote:
> On 6/1/2017 13:43, Andrew Haley wrote:
>>
>>> It is also possible to write a recognizer driver that works for both
>>> the traditional sort-out-the-stack approach and why-not-just-THROW
>>> without huge overhead, which is implemented in WF32.
>>
>> OK, I must have a look.
>
> THROW_UNDEFINED is -13. I'm reworking it from a ?DO loop to BEGIN etc as
> it's a little messy. A stack is structured as < count=n 1 2 .. n > cells.
Better factored, so it's clearer; (RECOG) is EXECUTE for the non-throw
variety, or as shown for either those that return DT:NULL or barf with
THROW.
: (recog) ( addr len xt -- i*x dt:type | dt:null )
catch -13 over = if
3drop dt:null \ not found
else throw then ; \ re-throw if not zero
: recognize ( addr len stack-id -- i*x dt:type | dt:null )
\ apply a recognizer stack to a string, delivering a token
dup cell+ swap @ cells bounds ?do
2dup i -rot 2>r \ not "2dup 2>r i"
@ (recog)
dt:null over <> if
2rdrop unloop exit
then
drop 2r> \ recover string
cell +loop
2drop dt:null ; \ exhausted stack
--
Alex
[toc] | [prev] | [next] | [standalone]
| From | anton@mips.complang.tuwien.ac.at (Anton Ertl) |
|---|---|
| Date | 2017-06-01 16:42 +0000 |
| Message-ID | <2017Jun1.184220@mips.complang.tuwien.ac.at> |
| In reply to | #60138 |
Andrew Haley <andrew29@littlepinkcloud.invalid> writes:
[Alex McDonald:]
>>>> Sometimes it's not possible to avoid, even with factoring; returning
>>>> to the caller (even a single level return) may have multiple DROPs
>>>> and R> DROPs just to get the stack back to anything sensible.
...
>Unless this is for the "too damn lazy to DROP the stuff I put on the
>stack" crowd, in which case I really don't care.
You finally got it after going very long on the wrong track
(especially funny if you don't care). But maybe the detour provided
some knowledge gain.
>(Having said all of that the use of exceptions to implement LOCATE by
>throwing to remove whatever a recognizer pushed makes sense, I get
>that.)
Come on, are you too damn lazy to do something like
depth >r fdepth >r .... fdepth r> - ?do fdrop loop depth r> - ?do drop loop
We had it hard in the good old days before CATCH/THROW, so why should
Forthers have it easy these days?-)
- anton
--
M. Anton Ertl http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
New standard: http://www.forth200x.org/forth200x.html
EuroForth 2017: http://www.euroforth.org/ef17/
[toc] | [prev] | [next] | [standalone]
| From | Andrew Haley <andrew29@littlepinkcloud.invalid> |
|---|---|
| Date | 2017-06-02 03:19 -0500 |
| Message-ID | <YuqdnVFsNvo4gqzEnZ2dnUU7-WvNnZ2d@supernews.com> |
| In reply to | #60156 |
Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote: > Andrew Haley <andrew29@littlepinkcloud.invalid> writes: > [Alex McDonald:] >>>>> Sometimes it's not possible to avoid, even with factoring; returning >>>>> to the caller (even a single level return) may have multiple DROPs >>>>> and R> DROPs just to get the stack back to anything sensible. > ... >>Unless this is for the "too damn lazy to DROP the stuff I put on the >>stack" crowd, in which case I really don't care. > > You finally got it after going very long on the wrong track > (especially funny if you don't care). I was being generous in assuming that my interlocutor was trying to do something that wasn't completely ridiculous but was trying to use THROW in a creative way. > But maybe the detour provided some knowledge gain. Hmm. I'm sure that's true, but not of anything useful. >>(Having said all of that the use of exceptions to implement LOCATE by >>throwing to remove whatever a recognizer pushed makes sense, I get >>that.) > > Come on, are you too damn lazy to do something like > > depth >r fdepth >r .... fdepth r> - ?do fdrop loop depth r> - ?do drop loop > > We had it hard in the good old days before CATCH/THROW, so why should > Forthers have it easy these days?-) This may be a joke, but it's wrong. In the "good old days" before CATCH/THROW we had SP@ and SP! on most systems, and that's what people would have used. Andrew.
[toc] | [prev] | [next] | [standalone]
| From | hughaguilar96@gmail.com |
|---|---|
| Date | 2017-06-01 14:07 -0700 |
| Message-ID | <841a04c0-e4c6-42d6-895c-c4f8ff4f81e9@googlegroups.com> |
| In reply to | #60133 |
On Thursday, June 1, 2017 at 2:08:09 AM UTC-7, Anton Ertl wrote: > So if you want to write a C parser and use the recognizer mechanism to > invoke it, there is nothing to stop you. But recognizers are not > necessary for this kind of stuff: Chuck Moore wrote his BASIC > interpreter without recognizers, Julian Noble wrote his Formula > Translator without recognizers, and IIRC you presented something along > these lines at EuroForth some years ago, too. So recognizers are not > necessary for this kind of stuff. They also don't provide support > that makes this kind of usage any easier. Recently, I have given some thought to writing a Pascal compiler for the 80c320 or PIC18 in VFX. It would likely be easier to write a Pascal compiler in Pascal rather than Forth, but I don't see any reason why it can't be done in Forth, and it might be more fun that way. A Pascal compiler is just a Forth application program --- this does not require that the Forth language standard be redefined. The Forth-200x committee want to redefine Forth --- they want to turn Forth into a Pascalish/Forthish muddle --- I think this disqualifies them as Forth programmers.
[toc] | [prev] | [next] | [standalone]
| From | Matthias Trute <matthias.trute@gmail.com> |
|---|---|
| Date | 2017-06-02 12:26 -0700 |
| Message-ID | <929605f5-1b33-43cb-8068-f09d09e4a9d9@googlegroups.com> |
| In reply to | #60133 |
> > Sure, when a recognizer fails Maybe here's the problem: A recognizer does not fail, it simply communicates "not my competence". A failure is something different. Maybe low memory or Ctrl-C pressed whatever else may happen. Such situations make sense for exceptions.
[toc] | [prev] | [next] | [standalone]
| From | minforth@arcor.de |
|---|---|
| Date | 2017-06-02 13:16 -0700 |
| Message-ID | <ce862787-213d-482a-8a0e-9561d1b5d74c@googlegroups.com> |
| In reply to | #60207 |
Am Freitag, 2. Juni 2017 21:26:03 UTC+2 schrieb Matthias Trute: > > > > Sure, when a recognizer fails > > Maybe here's the problem: A recognizer does not fail, it simply > communicates "not my competence". A failure is something different. > Maybe low memory or Ctrl-C pressed whatever else may happen. Such > situations make sense for exceptions. There is nothing wrong with this but conflicting competences (can be caused poor definitions in the standard). They must be solved by the programmer through manual assignment of priority in the recognizer chain sequence (or stack if you prefer the nomenclature). Comfortable that is not ....
[toc] | [prev] | [next] | [standalone]
| From | Matthias Trute <matthias.trute@gmail.com> |
|---|---|
| Date | 2017-06-03 01:34 -0700 |
| Message-ID | <b4a31170-b021-4dd4-9de5-88412b3e609c@googlegroups.com> |
| In reply to | #60208 |
> There is nothing wrong with this but conflicting competences (can > be caused poor definitions in the standard). Than either the data formats are poorly specified (see double vs. float numbers) or the implementation has bugs. With the very first recognizers I found many bugs in my number conversion routine. It simply throwed an exception when a string was not a number at many places. That was ok for the interpreter than, but when I wanted to add an additional recognizer after the one for the numbers it never got called. Step by step the number conversion got more precious and now is much cleaner and less like guru code than it was ever before. It did require some work on the oldest parts of my system, but it was well worth the effort. IMHO. > Comfortable that is not .... It's called freedom and choices and possibilities. Comfort is much like beauty: It lies in the eye of the beholder... Matthias
[toc] | [prev] | [next] | [standalone]
| From | minforth@arcor.de |
|---|---|
| Date | 2017-06-03 02:54 -0700 |
| Message-ID | <e97b316e-442a-4057-ab03-ea6ba86bb43e@googlegroups.com> |
| In reply to | #60219 |
Am Samstag, 3. Juni 2017 10:34:51 UTC+2 schrieb Matthias Trute: > > There is nothing wrong with this but conflicting competences (can > > be caused poor definitions in the standard). > > Than either the data formats are poorly specified (see double vs. float > numbers) or the implementation has bugs. > > With the very first recognizers I found many bugs in my number conversion > routine. It simply throwed an exception when a string was not a number at > many places. That was ok for the interpreter than, but when I wanted to > add an additional recognizer after the one for the numbers it never got > called. Step by step the number conversion got more precious and now is > much cleaner and less like guru code than it was ever before. It did require > some work on the oldest parts of my system, but it was well worth the effort. > IMHO. Very true. This is why I suggested a longish table of reference formats, depending on which wordsets are loaded on top of core or not. Would be very helpful for testing obscure format corners, and for detection of ambiguous specifications. And floats w/o decimal point should perhaps declared obsolescent.
[toc] | [prev] | [next] | [standalone]
| From | hughaguilar96@gmail.com |
|---|---|
| Date | 2017-06-01 13:53 -0700 |
| Message-ID | <ae7e2bf3-96b6-4b78-ad95-c947160c5f28@googlegroups.com> |
| In reply to | #60129 |
On Thursday, June 1, 2017 at 12:14:19 AM UTC-7, Andrew Haley wrote: > Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote: > > Andrew Haley <andrew29@littlepinkcloud.invalid> writes: > >>Surely if you've got a recursive bunch of recognizers you've > >>got a recursive-decent parser. > > > > The power you can exert at a recognizer is the full power of Forth. > > You can have a recognizer that recognizer A^nB^nC^n; try that with a > > recursive-descent parser. > > Whoever said that using recognizers was *limited* to a recursive- > descent parser? It is *at least* that. > > > My point is about the role it plays in the language, not about the > > (lack of) power of the mechanism. Recognizers deal with a single > > word. > > What does this last sentence mean? Recognizers aren't limited to a > single word. Here we have yet another Forth-200x committee member who obviously fails to understand the Forth language, and doesn't deserve to be called a Forth programmer. I recommend that all Forth programmers ignore Forth-200x as an abomination --- Forth-200x is not Forth!
[toc] | [prev] | [next] | [standalone]
| From | hughaguilar96@gmail.com |
|---|---|
| Date | 2017-06-01 13:48 -0700 |
| Message-ID | <6e48b184-71fd-460a-8309-a5e187893cf8@googlegroups.com> |
| In reply to | #60125 |
On Wednesday, May 31, 2017 at 10:49:54 PM UTC-7, Anton Ertl wrote: > Andrew Haley <andrew29@littlepinkcloud.invalid> writes: > >Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote: > >> Recognizers are more like scanners than parsers in Algol-family > >> languages, > > > >Really? > > Yes, really! > > > Surely if you've got a recursive bunch of recognizers you've > >got a recursive-decent parser. > > The power you can exert at a recognizer is the full power of Forth. > You can have a recognizer that recognizer A^nB^nC^n; try that with a > recursive-descent parser. My point is about the role it plays in the > language, not about the (lack of) power of the mechanism. Recognizers > deal with a single word. For the stuff where Algol uses the parser, > Forth uses the text interpreter and things like orig and dest. The reason why Algol and its many derivatives don't allow A^nB^nC^n is because their variables names can have more than one letter in them, so they can't use juxtaposition to represent multiplication. If you define a symbol as being one-letter though, then it is trivial to write a recursive-descent parser to accept: A^nB^nC^n All in all, I consider recognizers to be the stupidest idea I've seen since 1984 --- the previous stupidest idea was my own idea in 1984 of combining Forth and Pascal into a language called Forcal that used infix notation for arithmetic expressions but also somehow supported Forth's greatest feature, which was cross-compilation into micro-controllers (I didn't know how to write a cross-compiler at the time) --- these stupid ideas are pretty typical of first-year Forth programmers who are accustomed to mainstream languages such as C, Pascal, etc., but who don't understand that Forth is something more than a postfix version of C. The fact that you are supporting recognizers, and you are the chair-person of the Forth-200x committee, is reason enough for every Forth programmer in the world to completely ignore Forth-200x --- Forth-200x is the work of idiots who know nothing about Forth --- I don't consider Forth-200x to be Forth at all. Anton Ertl's support for recognizers totally discredits him as a Forth programmer! Millions of C programmers have already said: "If you want infix notation, then just use C!" Now, here is the Forth-200x committee chairman desperately trying to add infix notation to Forth. This makes Forth appear to be stupid and meaningless --- Forth appears to be a clumsy effort to write a C compiler --- I really recommend that Anton Ertl stick with C programming and stop pretending to be a Forth programmer!
[toc] | [prev] | [next] | [standalone]
| From | Alex <alex@rivadpm.com> |
|---|---|
| Date | 2017-06-01 22:31 +0100 |
| Message-ID | <ogq0td$1hk$1@dont-email.me> |
| In reply to | #60164 |
On 6/1/2017 21:48, hughaguilar96@gmail.com wrote: > Now, here is the Forth-200x committee chairman desperately trying to > add infix notation to Forth. Don't be such an enormous cockwomble. Of course he's not. -- Alex
[toc] | [prev] | [next] | [standalone]
| From | Andrew Haley <andrew29@littlepinkcloud.invalid> |
|---|---|
| Date | 2017-06-02 08:03 -0500 |
| Message-ID | <RqidndL6EYGy_6zEnZ2dnUU7-fudnZ2d@supernews.com> |
| In reply to | #60167 |
Alex <alex@rivadpm.com> wrote: > On 6/1/2017 21:48, hughaguilar96@gmail.com wrote: >> Now, here is the Forth-200x committee chairman desperately trying to >> add infix notation to Forth. > > Don't be such an enormous cockwomble. Of course he's not. Yay! The first use of "cockwomble" on c.l.f., as far as I can remember. Something to celebrate. :-) Andrew.
[toc] | [prev] | [next] | [standalone]
| From | albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) |
|---|---|
| Date | 2017-06-02 15:16 +0200 |
| Message-ID | <ogroer$qee$1@cherry.spenarnc.xs4all.nl> |
| In reply to | #60190 |
In article <RqidndL6EYGy_6zEnZ2dnUU7-fudnZ2d@supernews.com>, Andrew Haley <andrew29@littlepinkcloud.invalid> wrote: >Alex <alex@rivadpm.com> wrote: >> On 6/1/2017 21:48, hughaguilar96@gmail.com wrote: >>> Now, here is the Forth-200x committee chairman desperately trying to >>> add infix notation to Forth. >> >> Don't be such an enormous cockwomble. Of course he's not. > >Yay! The first use of "cockwomble" on c.l.f., as far as I can >remember. Something to celebrate. :-) Is there more to know than that it is a peiorative? > >Andrew. Groetjes Albert -- Albert van der Horst, UTRECHT,THE NETHERLANDS Economic growth -- being exponential -- ultimately falters. albert@spe&ar&c.xs4all.nl &=n http://home.hccnet.nl/a.w.m.van.der.horst
[toc] | [prev] | [next] | [standalone]
Page 5 of 11 — ← Prev page 1 … 3 4 [5] 6 7 … 11 Next page →
Back to top | Article view | comp.lang.forth
csiph-web