On-line synthesis of parsers for string events

Saffran, João; Barbosa, Haniel; Pereira, Fernando Magno Quintão; Vladamani, Srinivas

doi:10.1016/j.cola.2021.101022

Cited by 3 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our architecture could be adapted to other parsing methods that have the same power as GLR, such as GLL [44]. Since our architecture can parse any specification, it can be useful for applications where the specifications are generated procedurally, such as grammar synthesis [45]. We will also extend our metalanguage to support some of the use cases of our architecture better.…”

Section: Discussionmentioning

confidence: 99%

RNGSGLR: Generalization of the Context-Aware Scanning Architecture for All Character-Level Context-Free Languages

et al. 2022

View full text Add to dashboard Cite

The limitations of traditional parsing architecture are well known. Even when paired with parsing methods that accept all context-free grammars (CFGs), the resulting combination for any given CFG accepts only a limited subset of corresponding character-level context-free languages (CFL). We present a novel scanner-based architecture that for any given CFG accepts all corresponding character-level CFLs. It can directly parse all possible specifications consisting of a grammar and regular definitions. The architecture is based on right-nulled generalized LR (RNGLR) parsing and is a generalization of the context-aware scanning architecture. Our architecture does not require any disambiguation rules to resolve lexical conflicts, it conceptually has an unbounded parser and scanner lookahead and it is streaming. The added robustness and flexibility allow for easier grammar development and modification.

show abstract

Section: Discussionmentioning

confidence: 99%

RNGSGLR: Generalization of the Context-Aware Scanning Architecture for All Character-Level Context-Free Languages

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Code obfuscation has been used primarily to protect proprietary software from the unauthorized reverse engineering process. However, there are other potential applications of obfuscation (e.g., [65,66]). In our case, obfuscation was used to mimic code bloat in GP.…”

Section: Methodsmentioning

confidence: 99%

“…However, in the replicated experiment, we introduced a new threat to construct validity. We assumed that obfuscating [64][65][66] attribute grammars by mimicking code bloat is equivalent to automatically generated attribute grammars with code bloat by GP. Although this assumption appears to be reasonable since, in our obfuscation approach, operators and operands were the same as the sets F and T in GP [5,6,8] with no effect on the meaning of expression on the right hand of assignment, there was still a chance that, in obfuscating attribute grammars, mimicking code bloat had been under/over presented.…”

Section: Threats To Validitymentioning

confidence: 99%

The Impact of Code Bloat on Genetic Program Comprehension: Replication of a Controlled Experiment on Semantic Inference

Kosar,

Kovačević,

Mernik

et al. 2023

Mathematics

View full text Add to dashboard Cite

Our previous study showed that automatically generated attribute grammars were harder to comprehend than manually written attribute grammars, mostly due to unexpected solutions. This study is an internally differentiated replication of the previous experiment, but, unlike the previous one, it focused on testing the influence of code bloat on comprehension correctness and efficiency. While the experiment’s context, design, and measurements were kept mostly the same as in the original experiment, more realistic code bloat examples were introduced. The replicated experiment was conducted with undergraduate students from two universities, showing statistically significant differences in comprehension correctness and efficiency between attribute grammars without code bloat and attribute grammars with code bloat, although the participants perceived attribute grammars with code bloat as simple as attribute grammars without code bloat. On the other hand, there was no statistically significant difference in comprehension correctness and efficiency between automatically generated attribute grammars with possible unexpected solutions and attribute grammars with code bloat, although there was a statistically significant difference in participants’ perspective of simplicity between automatically generated attribute grammars with possible unexpected solutions and attribute grammars with code bloat. The participants perceived attribute grammars with code bloat as significantly simpler than automatically generated attribute grammars.

show abstract

Lushu: Ofuscação de Dados Sigilosos via Reconhecimento de Linguagens a partir de Exemplos

Holmquist,

Emanuel,

Pereira

2023

Proceedings of the XXVII Brazilian Symposium on Programming Languages

View full text Add to dashboard Cite

On-line synthesis of parsers for string events

Cited by 3 publications

References 18 publications

RNGSGLR: Generalization of the Context-Aware Scanning Architecture for All Character-Level Context-Free Languages

RNGSGLR: Generalization of the Context-Aware Scanning Architecture for All Character-Level Context-Free Languages

The Impact of Code Bloat on Genetic Program Comprehension: Replication of a Controlled Experiment on Semantic Inference

Lushu: Ofuscação de Dados Sigilosos via Reconhecimento de Linguagens a partir de Exemplos

Contact Info

Product

Resources

About