Using attributed flow graph parsing to recognize clichés in programs

DOI10.1007/3-540-61228-9_86zbMath1412.68045OpenAlexW1590958117MaRDI QIDQ4645274

Linda Wills

Publication date: 10 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_86

zbMATH Keywords

graph grammarflow graphgrammar ruleport typeprogram recognition

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Portability by automatic translation: A large-scale case study

Cites Work

• Hyperedge replacement: grammars and languages
• Plex languages
• Context-free graph grammars
• An efficient context-free parsing algorithm
• Separable graphs, planar graphs and web grammars
• Linear and Context-Free Graph Grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using attributed flow graph parsing to recognize clichés in programs