格雷巴赫范式的简单证明

Q4 Mathematics 信息与控制 Pub Date : 1984-12-01 DOI:10.1016/S0019-9958(84)80013-3

Andrzej Ehrenfeucht, Grzegorz Rozenberg

{"title":"格雷巴赫范式的简单证明","authors":"Andrzej Ehrenfeucht, Grzegorz Rozenberg","doi":"10.1016/S0019-9958(84)80013-3","DOIUrl":null,"url":null,"abstract":"<div><p>We present an algorithm which given an arbitrary <em>A</em>-free context-free grammar produces an equivalent context-free grammar in 2 Greibach normal form. The upper bound on the size of the resulting grammar in terms of the size of the initially given grammar is given. Our algorithm consists of an elementary construction, while the upper bound on the size of the resulting grammar is not bigger than the bounds known for other algorithms for converting context-free grammars into equivalent context-free grammars in Greibach normal form.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"63 3","pages":"Pages 190-199"},"PeriodicalIF":0.0000,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80013-3","citationCount":"11","resultStr":"{\"title\":\"An easy proof of Greibach normal form\",\"authors\":\"Andrzej Ehrenfeucht, Grzegorz Rozenberg\",\"doi\":\"10.1016/S0019-9958(84)80013-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We present an algorithm which given an arbitrary <em>A</em>-free context-free grammar produces an equivalent context-free grammar in 2 Greibach normal form. The upper bound on the size of the resulting grammar in terms of the size of the initially given grammar is given. Our algorithm consists of an elementary construction, while the upper bound on the size of the resulting grammar is not bigger than the bounds known for other algorithms for converting context-free grammars into equivalent context-free grammars in Greibach normal form.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"63 3\",\"pages\":\"Pages 190-199\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80013-3\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995884800133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995884800133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 11

摘要

我们提出了一种算法，给定任意A-free上下文无关语法，生成等价的2 Greibach范式的上下文无关语法。根据初始给定语法的大小，给出了结果语法大小的上界。我们的算法由一个基本结构组成，而结果语法大小的上界并不大于将上下文无关语法转换为等价的Greibach范式的上下文无关语法的其他算法的已知边界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

An easy proof of Greibach normal form

We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent context-free grammar in 2 Greibach normal form. The upper bound on the size of the resulting grammar in terms of the size of the initially given grammar is given. Our algorithm consists of an elementary construction, while the upper bound on the size of the resulting grammar is not bigger than the bounds known for other algorithms for converting context-free grammars into equivalent context-free grammars in Greibach normal form.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊