Re: Going backwards from a Language(or set of expressions) to a Grammar

Alain Ketterlin <alain@universite-de-strasbourg.fr>
Mon, 17 Apr 2017 12:57:58 +0200

          From comp.compilers

Related articles
Going backwards from a Language(or set of expressions) to a Grammar seimarao@gmail.com (Seima Rao) (2017-04-16)
Re: Going backwards from a Language(or set of expressions) to a Gramma seimarao@gmail.com (Seima Rao) (2017-04-17)
Re: Going backwards from a Language(or set of expressions) to a Gramma treid3@centurylink.net (Tom) (2017-04-17)
Re: Going backwards from a Language(or set of expressions) to a Gramma alain@universite-de-strasbourg.fr (Alain Ketterlin) (2017-04-17)
Re: Going backwards from a Language(or set of expressions) to a Gramma derek@_NOSPAM_knosof.co.uk (Derek M. Jones) (2017-04-17)
| List of all articles for this month |

From: Alain Ketterlin <alain@universite-de-strasbourg.fr>
Newsgroups: comp.compilers
Date: Mon, 17 Apr 2017 12:57:58 +0200
Organization: =?utf-8?Q?Universit=C3=A9?= de Strasbourg
References: 17-04-014
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

Seima Rao <seimarao@gmail.com> 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.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.