Re: syntax complexity

Roger L Costello <>
Mon, 20 Feb 2023 15:09:18 +0000

          From comp.compilers

Related articles
syntax complexity (gah4) (2023-02-15)
Re: syntax complexity (Thomas Koenig) (2023-02-16)
Re: syntax complexity (Hans-Peter Diettrich) (2023-02-16)
Re: syntax complexity (gah4) (2023-02-16)
Re: syntax complexity (gah4) (2023-02-16)
Re: syntax complexity (Roger L Costello) (2023-02-20)
Re: syntax complexity (gah4) (2023-02-20)
Re: syntax complexity (George Neuner) (2023-02-20)
Re: syntax complexity (2023-02-21)
syntax complexity (Christopher F Clark) (2023-02-21)
Re: syntax complexity (Nils M Holm) (2023-02-21)
Re: syntax complexity (2023-02-21)
[3 later articles]
| List of all articles for this month |

From: Roger L Costello <>
Newsgroups: comp.compilers
Date: Mon, 20 Feb 2023 15:09:18 +0000
Organization: Compilers Central
References: 23-02-045 23-02-047 23-02-050 <29156_1676600565_63EEE4F4_29156_1009_1_23-02-051@comp.compilers>
Injection-Info:; posting-host=""; logging-data="28399"; mail-complaints-to=""
Keywords: syntax, question
Posted-Date: 20 Feb 2023 12:46:00 EST
Thread-Topic: syntax complexity
Thread-Index: AQHZRT1Nf7Ln0mpyG0extuZP9rnVPQ==
In-Reply-To: <29156_1676600565_63EEE4F4_29156_1009_1_23-02-051@comp.compilers>
Accept-Language: en-US
Content-Language: en-US

Hello Compiler Experts!

Scenario: you have a language that has a BNF. You write a statement in the language. It is a relatively simple, basic statement. The statement conforms to the BNF. To show its conformance, you write the derivation of the statement. Surprisingly, deriving the statement takes many, many rules. Does that signify that the language's syntax is too complex?


Post a followup to this message

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