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

DOI10.1007/3-540-61228-9_86MaRDI QIDQ4645274zbMATH OpenOpenAlexFDO

Authors 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

flow graphgraph grammargrammar ruleport typeprogram recognition

Mathematics Subject Classification ID

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

Recommendations

• Publication:3489466
• scientific article; zbMATH DE number 3909759
• A generalized mathematical theory of structured programming
• scientific article; zbMATH DE number 3854448
• scientific article; zbMATH DE number 1008446

Cites work

• scientific article; zbMATH DE number 4162279 (Why is no real title available?)
• scientific article; zbMATH DE number 3907745 (Why is no real title available?)
• scientific article; zbMATH DE number 43241 (Why is no real title available?)
• scientific article; zbMATH DE number 219261 (Why is no real title available?)
• scientific article; zbMATH DE number 3410623 (Why is no real title available?)
• An efficient context-free parsing algorithm
• Context-free graph grammars
• Hyperedge replacement: grammars and languages
• Linear and Context-Free Graph Grammars
• Plex languages
• Separable graphs, planar graphs and web grammars

Cited in

(1)

• Portability by automatic translation: A large-scale case study

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645274)