Re: irregular expressions, syntax complexity

arnold@freefriends.org (Aharon Robbins)
22 Feb 2023 08:53:05 GMT

          From comp.compilers
Related articles
Re: syntax complexity costello@mitre.org (Roger L Costello) (2023-02-20)
Re: syntax complexity gah4@u.washington.edu (gah4) (2023-02-20)
Re: syntax complexity anton@mips.complang.tuwien.ac.at (2023-02-21)
Re: irregular expressions, syntax complexity arnold@freefriends.org (2023-02-22)
Re: irregular expressions, syntax complexity 864-117-4973@kylheku.com (Kaz Kylheku) (2023-02-23)
| List of all articles for this month |
From: arnold@freefriends.org (Aharon Robbins)
Newsgroups: comp.compilers
Date: 22 Feb 2023 08:53:05 GMT
Organization: non
References: <AQHZRT1Nf7Ln0mpyG0extuZP9rnVPQ==> 23-02-052 23-02-053 23-02-055
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="75714"; mail-complaints-to="abuse@iecc.com"
Keywords: syntax, lex
Posted-Date: 22 Feb 2023 11:58:01 EST
Originator: arnold@freefriends.org (Aharon Robbins)

In article 23-02-055,
Anton Ertl <anton@mips.complang.tuwien.ac.at> wrote:
>Regular expression syntax is missing an operator that signifies the
>intersection of the sets recognized by the operand regexps. Let's
>call this operator "&". ....
>
>Has anybody implemented such an operator at all?


Doug McIlroy did, if I understand things correctly. See
https://github.com/arnoldrobbins/mcilroy-regex/blob/master/README
for more info.


Arnold

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.