Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 2,686 of 2,753    |
|    Roger L Costello to All    |
|    Re: syntax complexity    |
|    20 Feb 23 15:09:18    |
      4aca7553       From: costello@mitre.org              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?              /Roger              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca