Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!news.misty.com!news.iecc.com!.POSTED!nerds-end From: "lpsantil@gmail.com" Newsgroups: comp.compilers Subject: Re: specifying semantics, was Formatting of Language LRMs Date: Tue, 24 Jun 2014 13:12:49 -0700 (PDT) Organization: Compilers Central Lines: 11 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <14-06-024@comp.compilers> References: <14-06-010@comp.compilers> <14-06-023@comp.compilers> NNTP-Posting-Host: news.iecc.com Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit X-Trace: miucha.iecc.com 1403643892 69398 2001:470:1f07:1126:0:676f:7373:6970 (24 Jun 2014 21:04:52 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Tue, 24 Jun 2014 21:04:52 +0000 (UTC) Keywords: semantics Posted-Date: 24 Jun 2014 17:04:52 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20130820; h=path:newsgroups:date:in-reply-to:complaints-to:injection-info :nntp-posting-host:references:user-agent:mime-version:message-id :subject:from:injection-date:to:content-type :content-transfer-encoding; bh=sSi8gd8YNEBCtIs0BEFufv3eptW7/Y4UfwlwR041CWA=; b=mjJ2oAOs85xgrar1dOGMjX44sDjFk5Xp7/H6sn0xuhBRdJIdBMo77yhfLTrPjFxjRc B+zupprTlZ9Nvn3m+mHY6e3USmRE/rcIvmweVG9iTIDCVcGskbVceLRCsBtKg73W0n7J jR5Q1naKR9JZjK6zuqftlbmveLJnjfzMFsL9BAz0r5s8S73BAvLgNQ5B4lQPVXzt0J43 qcjNB1QZuJZwF9AoPgI4ttrfVDp2lhfCoSrhc7+AQct7+jQPEYWlGR6FXZI5egmsnGIO sB7u/mj8LwC4KilKB/2gdzKeiNsGo8WqSWrvCXenUKdUzCuTcL/34KrtGIQ6NlPrikGk DkTg== Xref: csiph.com comp.compilers:1279 On Tuesday, June 24, 2014 2:19:05 AM UTC-7, seim...@gmail.com wrote: > Is there something for semantics as BNF is for grammars ? > > What do the books on type systems, lambda calculus, etc, teach and You mention type systems and their analysis is one other formalism. Another I thought of which is maybe an odd edge case are PEGs (Parsing Expression Grammars). They are non-ambiguous grammars and their semantics are limited/defined in the "mother" language. However, I would argue that going from the semantics in a PEG to general semantic "text/word/explanation" would be very difficult.