Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.forth > #58940

Re: "Recognizing" a parser generator (and a compiler compiler)

From Alex <alex@rivadpm.com>
Newsgroups comp.lang.forth
Subject Re: "Recognizing" a parser generator (and a compiler compiler)
Date 2017-05-10 08:59 +0100
Organization A noiseless patient Spider
Message-ID <oeuh2u$ebo$1@dont-email.me> (permalink)
References (1 earlier) <oepapj$k1q$1@dont-email.me> <d743e777-3e6d-4512-8aab-bc3ac0c541be@googlegroups.com> <oerolq$5jd$1@dont-email.me> <h-qdnd58EbSt74zEnZ2dnUU7-IPNnZ2d@supernews.com> <888e79a6-6b36-46b9-b239-fafbb1ee4e14@googlegroups.com>

Show all headers | View raw


On 5/10/2017 08:53, Joel Rees wrote:
> The fact that Forth words are written as simple nearly context-free
> automata does nothing to negate the larger syntax. Nor does the fact
> that you can, at run-time add to the grammar to provide additional
> syntax (and semantics).

I'd like to see a formal grammar specification for Forth. Is such a 
thing possible? IMHO about the only words that have this notion are 
parsing words like : VALUE CONSTANT and those that have some form of 
control flow requirements like ; IF THEN ELSE .

-- 
Alex

Back to comp.lang.forth | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

"Recognizing" a parser generator (and a compiler compiler) Joel Rees <joel.rees@gmail.com> - 2017-05-07 19:29 -0700
  Re: "Recognizing" a parser generator (and a compiler compiler) hughaguilar96@gmail.com - 2017-05-07 21:57 -0700
    Re: "Recognizing" a parser generator (and a compiler compiler) Alex <alex@rivadpm.com> - 2017-05-08 09:55 +0100
  Re: "Recognizing" a parser generator (and a compiler compiler) Alex <alex@rivadpm.com> - 2017-05-08 09:41 +0100
    Re: "Recognizing" a parser generator (and a compiler compiler) Joel Rees <joel.rees@gmail.com> - 2017-05-08 21:07 -0700
      Re: "Recognizing" a parser generator (and a compiler compiler) Alex <alex@rivadpm.com> - 2017-05-09 07:50 +0100
        Re: "Recognizing" a parser generator (and a compiler compiler) "Elizabeth D. Rather" <erather@forth.com> - 2017-05-08 21:39 -1000
          Re: "Recognizing" a parser generator (and a compiler compiler) "HAA" <someone@microsoft.com> - 2017-05-10 15:27 +1000
            Re: "Recognizing" a parser generator (and a compiler compiler) Alex <alex@rivadpm.com> - 2017-05-10 08:21 +0100
              Re: "Recognizing" a parser generator (and a compiler compiler) "HAA" <someone@microsoft.com> - 2017-05-10 18:15 +1000
          Re: "Recognizing" a parser generator (and a compiler compiler) Joel Rees <joel.rees@gmail.com> - 2017-05-10 00:53 -0700
            Re: "Recognizing" a parser generator (and a compiler compiler) Alex <alex@rivadpm.com> - 2017-05-10 08:59 +0100
      Re: "Recognizing" a parser generator (and a compiler compiler) mhx@iae.nl - 2017-05-10 02:52 -0700
        Re: "Recognizing" a parser generator (and a compiler compiler) albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-05-10 11:59 +0200
          Re: "Recognizing" a parser generator (and a compiler compiler) Joel Rees <joel.rees@gmail.com> - 2017-05-10 05:46 -0700
          Re: "Recognizing" a parser generator (and a compiler compiler) mhx@iae.nl - 2017-05-10 05:48 -0700

csiph-web