{"title":"LR(k)解析表的实用优化","authors":"M. Ancona, A. Bartolozzi, M. Paci, S. Provvedi","doi":"10.1109/PCCC.1992.200607","DOIUrl":null,"url":null,"abstract":"A method for optimizing LR(k) tables is presented. This method extends the algorithms of phi -inaccessible tables and error postponement for LR(k) tables defined by A. V. Aho and J. D. Ullman (1972, 1973) to a new kind of parsing tables, called reduced tables. Reduced tables are more convenient than canonical tables for all classes of LR grammars. For example, reduced tables can be effectively used to create full LR parsers for programming languages like Pascal, C, Oberon, and Eiffel. Experiments with some important programming languages show rates of optimization of the order of 70% of the eliminated tables and of 50% of nonerror deleted entries. Such results have been obtained with the grammars of programming languages like Ada, Pascal, C, Oberon, and Modula-2.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Practical optimizations of LR(k) parsing tables\",\"authors\":\"M. Ancona, A. Bartolozzi, M. Paci, S. Provvedi\",\"doi\":\"10.1109/PCCC.1992.200607\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for optimizing LR(k) tables is presented. This method extends the algorithms of phi -inaccessible tables and error postponement for LR(k) tables defined by A. V. Aho and J. D. Ullman (1972, 1973) to a new kind of parsing tables, called reduced tables. Reduced tables are more convenient than canonical tables for all classes of LR grammars. For example, reduced tables can be effectively used to create full LR parsers for programming languages like Pascal, C, Oberon, and Eiffel. Experiments with some important programming languages show rates of optimization of the order of 70% of the eliminated tables and of 50% of nonerror deleted entries. Such results have been obtained with the grammars of programming languages like Ada, Pascal, C, Oberon, and Modula-2.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200607\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200607","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A method for optimizing LR(k) tables is presented. This method extends the algorithms of phi -inaccessible tables and error postponement for LR(k) tables defined by A. V. Aho and J. D. Ullman (1972, 1973) to a new kind of parsing tables, called reduced tables. Reduced tables are more convenient than canonical tables for all classes of LR grammars. For example, reduced tables can be effectively used to create full LR parsers for programming languages like Pascal, C, Oberon, and Eiffel. Experiments with some important programming languages show rates of optimization of the order of 70% of the eliminated tables and of 50% of nonerror deleted entries. Such results have been obtained with the grammars of programming languages like Ada, Pascal, C, Oberon, and Modula-2.<>
![Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
