Context Free, Context Sensitive and Type 0 grammars are based on http://en.wikipedia.org/wiki/Chomsky_hierarchy
A programming language is based on a strong foundation of a context-free grammar. Imagine a text-based AI program that would be able to learn through trial and error. It is feasible to teach the trial and error AI program simple programming grammars, like simple database commands. Therefore it is feasible to teach the program Type 0 grammars. By using the simple database commands that it had learned it would be possible for the program to learn simple context-sensitive grammars. ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
