构建LR(k)解析器的车道跟踪算法

Proceedings of the fifth annual ACM symposium on Theory of computing Pub Date : 1973-04-30 DOI:10.1145/800125.804048

D. Pager

{"title":"构建LR(k)解析器的车道跟踪算法","authors":"D. Pager","doi":"10.1145/800125.804048","DOIUrl":null,"url":null,"abstract":"The paper presents, as far as the author is aware, the first practical general method for constructing LR(k) parsers. It has been used, without computational difficulty, to produce LR(1), LR(2) and LR(3) parsers for grammars of the size of ALGOL.","PeriodicalId":242946,"journal":{"name":"Proceedings of the fifth annual ACM symposium on Theory of computing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1973-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"The lane tracing algorithm for constructing LR(k) parsers\",\"authors\":\"D. Pager\",\"doi\":\"10.1145/800125.804048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents, as far as the author is aware, the first practical general method for constructing LR(k) parsers. It has been used, without computational difficulty, to produce LR(1), LR(2) and LR(3) parsers for grammars of the size of ALGOL.\",\"PeriodicalId\":242946,\"journal\":{\"name\":\"Proceedings of the fifth annual ACM symposium on Theory of computing\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1973-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fifth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800125.804048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fifth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800125.804048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

据作者所知，本文提出了构建LR(k)解析器的第一个实用的通用方法。它已经被使用，没有计算困难，为ALGOL大小的语法生成LR(1)， LR(2)和LR(3)解析器。

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

查看原文本刊更多论文

The lane tracing algorithm for constructing LR(k) parsers

The paper presents, as far as the author is aware, the first practical general method for constructing LR(k) parsers. It has been used, without computational difficulty, to produce LR(1), LR(2) and LR(3) parsers for grammars of the size of ALGOL.

求助全文

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

来源期刊

Proceedings of the fifth annual ACM symposium on Theory of computing

CiteScore

7.80

自引率

0.00%

发文量