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
This article is within the scope of WikiProject Linguistics, a collaborative effort to improve the coverage of linguistics 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.LinguisticsWikipedia:WikiProject LinguisticsTemplate:WikiProject LinguisticsLinguistics articles
This page only references very recent papers (2002 and on), but boolean grammars and an efficient recognizer for them was described at least as early as 1988 by Heilbrunner, in "An efficient recognizer for the Boolean closure of context-free languages", see http://www.sciencedirect.com/science/article/pii/030439759190205G for the full text PDF of the page (no charge, open access). In case it is not clear, yes, the definition of "the Boolean closure of context-free languages" is *exactly* equivalent to the definition "Boolean Grammars", just with different notation.