Parser Generator for Parsing Expression Grammar
Journal: COMPUSOFT 'An International Journal of Advanced Computer Technology' (Vol.2, No. 7)Publication Date: 2013-06-26
Authors : Madhavi Tota;
Page : 188-192
Keywords : PEG; memorization; lexer; backtracking; CFG;
Abstract
: In the field of formal languages apart from context free grammar (CFG) a new approach is developed i.e. Parsing Expression Grammar (PEG). Parsing Expression Grammar (PEG) is a new way to specify recursive-descent parsers with limited backtracking. The use of backtracking lifts the LL(1) restriction usually imposed by top-down parsers. In addition, PEG can directly define the structures that usually require a separate “lexer” or “scanner”. The parser has many useful properties, and with the use of memorization, it works in a linear time. This paper reports an experiment that consisted of defining PEG formalism, and literally transcribing the PEG definitions into parsing procedures.
Other Latest Articles
- OS design challenges & research opportunities in real-time WSNs & approach for real time support in Nano-RK
- Improving the Performance of Crawler Using Body Text Normalization
- Dvadasham (Dodeca) Edge Filter for Impulse Noise, Gaussian Noise, Quantum Noise Reduction in Images
- A-MMLQ Algorithm for Multi-level Queue Scheduling
- Rural mental health in India
Last modified: 2013-08-11 21:05:04