Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c > #141288
| From | David Brown <david.brown@hesbynett.no> |
|---|---|
| Newsgroups | comp.lang.c |
| Subject | Re: Interpretation of EBNF |
| Date | 2019-02-25 09:57 +0100 |
| Organization | A noiseless patient Spider |
| Message-ID | <q50amd$9a8$1@dont-email.me> (permalink) |
| References | <EBNF-20190224151913@ram.dialup.fu-berlin.de> <lnwolporh8.fsf@kst-u.example.com> |
On 24/02/2019 21:34, Keith Thompson wrote: > ram@zedat.fu-berlin.de (Stefan Ram) writes: >> The EBNF of C reads (excerpt): >> >> unary-expression: >> postfix-expression >> unary-operator unary-expression >> >> . The following question surely serves no practical demand, >> but just for the sake of correctly interpreting EBNF: >> >> The above surely allows a unary expression to be preceded >> by a finite number of minus signs (unary operators). >> >> When there is an infinite number (say Aleph_0) of minus signs >> and then a unary-expression, is this also a unary expression? > > I'll let you know as soon as I finish parsing this infinite input. > What we need here is lazy evaluation. I have the answer ready theoretically, as long as you only ask for a small bit of it at a time.
Back to comp.lang.c | Previous | Next — Previous in thread | Find similar | Unroll thread
Re: Interpretation of EBNF Keith Thompson <kst-u@mib.org> - 2019-02-24 12:34 -0800 Re: Interpretation of EBNF David Brown <david.brown@hesbynett.no> - 2019-02-25 09:57 +0100
csiph-web