Elton M. Cardoso , Leonardo V.S. Reis , Rodrigo G. Ribeiro
{"title":"一个用于自适应解析表达式语法的Haskell库","authors":"Elton M. Cardoso , Leonardo V.S. Reis , Rodrigo G. Ribeiro","doi":"10.1016/j.cola.2025.101349","DOIUrl":null,"url":null,"abstract":"<div><div>Adaptable Parsing Expression Grammars (APEG) is a formal model for describing languages that provide a mechanism to extend their own syntax during the parsing process. In this work, we review the syntax and semantics of APEG, discuss the implementation of a Haskell library for building parsers for extensible languages and using it to construct an APEG parser for a tiny extensible language.</div></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"85 ","pages":"Article 101349"},"PeriodicalIF":1.8000,"publicationDate":"2025-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Haskell Library for Adaptable Parsing Expression Grammars\",\"authors\":\"Elton M. Cardoso , Leonardo V.S. Reis , Rodrigo G. Ribeiro\",\"doi\":\"10.1016/j.cola.2025.101349\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Adaptable Parsing Expression Grammars (APEG) is a formal model for describing languages that provide a mechanism to extend their own syntax during the parsing process. In this work, we review the syntax and semantics of APEG, discuss the implementation of a Haskell library for building parsers for extensible languages and using it to construct an APEG parser for a tiny extensible language.</div></div>\",\"PeriodicalId\":48552,\"journal\":{\"name\":\"Journal of Computer Languages\",\"volume\":\"85 \",\"pages\":\"Article 101349\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2025-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer Languages\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2590118425000358\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Languages","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2590118425000358","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
A Haskell Library for Adaptable Parsing Expression Grammars
Adaptable Parsing Expression Grammars (APEG) is a formal model for describing languages that provide a mechanism to extend their own syntax during the parsing process. In this work, we review the syntax and semantics of APEG, discuss the implementation of a Haskell library for building parsers for extensible languages and using it to construct an APEG parser for a tiny extensible language.