{"title":"扩展的LL(k)语法和解析器","authors":"Yen-Jen Oyang, Ching-Chi Hsu","doi":"10.1145/503896.503938","DOIUrl":null,"url":null,"abstract":"A class of context-free grammars, called \"Extended LL(k)\" or ELL(k), is defined. This class has been shown to include LL(k) grammars as proper subset, and there are some grammars which are ELL(k) grammars but not LALR(k) grammars.An algorithm to construct persers for ELL(k) grammars is proposed in this paper.Before this paper had been completed, PL/O language was taken as a sample. A parser was constructed for it by ELL(k) technique.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Extended LL(k) grammars and parsers\",\"authors\":\"Yen-Jen Oyang, Ching-Chi Hsu\",\"doi\":\"10.1145/503896.503938\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A class of context-free grammars, called \\\"Extended LL(k)\\\" or ELL(k), is defined. This class has been shown to include LL(k) grammars as proper subset, and there are some grammars which are ELL(k) grammars but not LALR(k) grammars.An algorithm to construct persers for ELL(k) grammars is proposed in this paper.Before this paper had been completed, PL/O language was taken as a sample. A parser was constructed for it by ELL(k) technique.\",\"PeriodicalId\":184493,\"journal\":{\"name\":\"ACM-SE 20\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 20\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/503896.503938\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 20","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/503896.503938","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A class of context-free grammars, called "Extended LL(k)" or ELL(k), is defined. This class has been shown to include LL(k) grammars as proper subset, and there are some grammars which are ELL(k) grammars but not LALR(k) grammars.An algorithm to construct persers for ELL(k) grammars is proposed in this paper.Before this paper had been completed, PL/O language was taken as a sample. A parser was constructed for it by ELL(k) technique.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
