TRX: A Formally Verified Parser Interpreter

Details TRX: A Formally Verified Parser Interpreter TRX: A Formally Verified Parser Interpreter

2011-05-12

arxiv.org/abs/1105.2576v2

LMCS 7 (2:18) 2011

Computer Science

Logic in Computer Science

26 pages, LMCS

Scientific paper

10.2168/LMCS-7(2:18)2011

Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser interpreter formally developed in the proof assistant Coq, capable of producing formally correct parsers. We are using parsing expression grammars (PEGs), a formalism essentially representing recursive descent parsing, which we consider an attractive alternative to context-free grammars (CFGs). From this formalization we can extract a parser for an arbitrary PEG grammar with the warranty of total correctness, i.e., the resulting parser is terminating and correct with respect to its grammar and the semantics of PEGs; both properties formally proven in Coq.

Affiliated with

Also associated with

No associations

Rating

TRX: A Formally Verified Parser Interpreter does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with TRX: A Formally Verified Parser Interpreter, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and TRX: A Formally Verified Parser Interpreter will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26537