Cut Points in PEG

Issue title: Concurrency, Specification and Programming (CS&P)

Guest editors: Ludwik Czaja, Wojciech Penczek and Krzysztof Stencel

Article type: Research Article

Authors: Redziejowski, Roman R.^*

Affiliations: Ceremonimästarvägen 10, SE-181 40 Lidingö, Sweden. roman.redz@swipnet.se

Correspondence: [*] Address for correspondence: Ceremonimästarvägen 10, SE-181 40 Lidingö, Sweden

Abstract: Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. It has been recently noticed that in the situation when the parser is to explore several alternatives one after another, no further alternatives need to be explored after the parser reached certain “cut point”. This fact can be used to save both processing time and storage. The subject of the paper is identification of cut points, which can also help in producing better diagnostics.

DOI: 10.3233/FI-2016-1308

Journal: Fundamenta Informaticae, vol. 143, no. 1-2, pp. 141-149, 2016