Path: csiph.com!feeder.erje.net!2.us.feeder.erje.net!newspeer1.nac.net!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: "Derek M. Jones" Newsgroups: comp.compilers Subject: Re: Going backwards from a Language(or set of expressions) to a Grammar Date: Mon, 17 Apr 2017 15:29:17 +0100 Organization: virginmedia.com Lines: 15 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <17-04-018@comp.compilers> References: <17-04-014@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Info: miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="19294"; mail-complaints-to="abuse@iecc.com" Keywords: parse, syntax Posted-Date: 17 Apr 2017 10:30:37 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:1857 Seima Rao, > Is it possible generally to arrive at a grammar from > a language or set of expressions ? > > How so? A language is a grammar+other stuff. You can come up with umpteen grammars for a set of expressions. Your problem is Poverty of the stimulus: https://en.wikipedia.org/wiki/Poverty_of_the_stimulus What do you want to do with the grammars?