From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Writing a scanner and parser in Ada
Date: Tue, 26 Dec 2017 22:45:41 +0100
Date: 2017-12-26T22:45:41+01:00 [thread overview]
Message-ID: <p1ufu4$1nnk$1@gioia.aioe.org> (raw)
In-Reply-To: aa4de6f2-1bda-4e72-be0d-c4aac324fd3b@googlegroups.com
On 2017-12-26 19:06, Shark8 wrote:
> Let's consider a simple example. We want to write a pattern to test
> for a list. We'll define a list as being one or more numbers
> separated by comma, and enclosed by parentheses.
Toy examples prove nothing.
> The above seems quite straightforward, and IMO, easier to comprehend
> than an equivalent regular expression.
Yes SNOBOL is easier to understand than regular expressions, because it
was designed as programming language. Regular expressions were not.
> So, IMO, SNOBOL itself proves as a counterexample to your claim.
No, it does not prove that. Griswold et all give in their book an
example of SNOBOL parser written in SNOBOL. Compare that with a parser
written in Ada.
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
next prev parent reply other threads:[~2017-12-26 21:45 UTC|newest]
Thread overview: 16+ messages / expand[flat|nested] mbox.gz Atom feed top
2017-12-24 1:15 Writing a scanner and parser in Ada Yves Cloutier
2017-12-24 4:07 ` Robert Eachus
2017-12-25 16:32 ` Yves Cloutier
2017-12-24 9:08 ` Dmitry A. Kazakov
2017-12-24 15:09 ` Niklas Holsti
2017-12-25 16:37 ` Yves Cloutier
2017-12-25 16:35 ` Yves Cloutier
2017-12-25 17:08 ` Dmitry A. Kazakov
2017-12-25 18:57 ` Yves Cloutier
2017-12-25 19:19 ` Dmitry A. Kazakov
2017-12-26 18:06 ` Shark8
2017-12-26 21:45 ` Dmitry A. Kazakov [this message]
2017-12-26 22:20 ` Dmitry A. Kazakov
2017-12-24 14:40 ` Tero Koskinen
2017-12-25 16:36 ` Yves Cloutier
2017-12-24 15:33 ` Lucretia
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox