Efficient parsing with parser combinators

Sci. Comput. Program., Volume 161, 2018, Pages 57-88.

Cited by: 0|Bibtex|Views6|Links
EI

Abstract:

Abstract Parser combinators offer a universal and flexible approach to parsing. They follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, these advantages introduce a noticeable performance overhead mainly ...More

Code:

Data:

Your rating :
0

 

Tags
Comments