Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [11 earlier articles] |
| Re: A minimal LL(1) parser generator ? gaztoast@gmail.com (honey crisis) (2020-01-05) |
| Re: A minimal LL(1) parser generator ? carlglassberg@gmail.com (2020-01-05) |
| Re: A minimal LL(1) parser generator ? carlglassberg@gmail.com (2020-01-05) |
| Re: A minimal LL(1) parser generator ? carlglassberg@gmail.com (2020-01-05) |
| Re: A minimal LL(1) parser generator ? anton@mips.complang.tuwien.ac.at (2020-01-22) |
| Re: A minimal LL(1) parser generator ? anton@mips.complang.tuwien.ac.at (2020-01-22) |
| Re: A minimal LL(1) parser generator ? carlglassberg@gmail.com (2020-01-23) |
| Re: A minimal LL(1) parser generator ? anton@mips.complang.tuwien.ac.at (2020-01-25) |
| Re: A minimal LL(1) parser generator ? FredJScipione@alum.RPI.edu (Fred J. Scipione) (2020-01-25) |
| From: | carlglassberg@gmail.com |
| Newsgroups: | comp.compilers |
| Date: | Thu, 23 Jan 2020 02:41:24 -0800 (PST) |
| Organization: | Compilers Central |
| References: | 19-12-016 19-12-030 19-12-032 19-12-040 20-01-001 20-01-003 20-01-008 20-01-025 |
| Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="8852"; mail-complaints-to="abuse@iecc.com" |
| Keywords: | LL(1) |
| Posted-Date: | 23 Jan 2020 10:29:09 EST |
Anton, I now see that, in Gray, the precedence of "&&" is higher than every other operator.
So Gray EBNF:
a b && c d && e f && <- x
is equivalent to Wirth EBNF:
x = a { b a } c { d c } e { f e } .
Likewise:
a b && ? <- x
is
x = [ a { b a } ] .
Carl
Return to the
comp.compilers page.
Search the
comp.compilers archives again.