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,327 of 2,753    |
|    Seima Rao to All    |
|    Semantics, opt in Semantics    |
|    15 Jan 15 17:42:17    |
      From: seimarao@gmail.com              Hi,               The Backus Naur Form is a great mathematical model. It explains syntax        quite succintly.               In that form, the opt qualifier which stands for optional or        epsilon is utilized extensively for optional syntax.               Is there something similar for semantics i.e. is there something optional        in semantics.               Also, what is the equivalent in semantics of BNF ?              Sincerely,       Seima Rao.       [Man, there's a can of worms. There's no semantic formalism that matches real       semantics as well as BNF matches real syntax. -John]              --- 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