On the relation between context-free grammars and parsing expression grammars
Context-Free Grammars (CFGs) and Parsing Expression Grammars (PEGs) have several similarities and a few differences in both their syntax and semantics, but they are usually presented through formalisms that hinder a proper comparison. In this paper we present a new formalism for CFGs that highlights...
Saved in:
Published in | Science of computer programming Vol. 89; pp. 235 - 250 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.09.2014
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!