Path: csiph.com!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Alain Ketterlin Newsgroups: comp.compilers Subject: Re: Going backwards from a Language(or set of expressions) to a Grammar Date: Mon, 17 Apr 2017 12:57:58 +0200 Organization: =?utf-8?Q?Universit=C3=A9?= de Strasbourg Lines: 13 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <17-04-017@comp.compilers> References: <17-04-014@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="11421"; mail-complaints-to="abuse@iecc.com" Keywords: parse Posted-Date: 17 Apr 2017 09:54:47 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:1856 Seima Rao writes: > Is it possible generally to arrive at a grammar from > a language or set of expressions ? It is called grammatical (or grammar) inference, or grammar induction. Wikipedia has a (mildly useful) entry at: https://en.wikipedia.org/wiki/Grammar_induction and googling "grammatical inference" provides additional pointers. -- Alain.