Talk:Greibach normal form

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer science High‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles High This article has been rated as High-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}} Philosophy: Logic Low‑importance This article is within the scope of WikiProject Philosophy, a collaborative effort to improve the coverage of content related to philosophy on Wikipedia. If you would like to support the project, please visit the project page, where you can get more details on how you can help, and where you can join the general discussion about philosophy content on Wikipedia.PhilosophyWikipedia:WikiProject PhilosophyTemplate:WikiProject PhilosophyPhilosophy articles Low This article has been rated as Low-importance on the project's importance scale. Associated task forces: /  Logic

There is a problem, see: http://en.wikipedia.org/wiki/Talk:Chomsky_normal_form#Terminology_.2F_Meta-Variable_Confusion

Janburse (talk) 12:30, 20 June 2011 (UTC)[reply]

Anyone mind if I clarify the statment "Observe that the grammar must be without left recursions."? This means that the Greibach normal form results in a grammar with no left recursions, correct? As opposed to meaning that the initial grammar must be without left recursions in order for it to be converted to Greibach normal form? — Preceding unsigned comment added by 202.7.215.198 (talk) 05:46, 18 April 2012 (UTC)[reply]

As the leftmost symbol of a production in GNF is always a terminal, it would seem that left recursion can not occur in a GNF grammar. 5.186.55.135 (talk) 11:12, 27 January 2023 (UTC)[reply]