A grammar for spreadsheet formulas evaluated on two large datasets

• Published in: 2015 IEEE 15th International Working Conference on Source Code Analysis and Manipulation (SCAM) pp. 121 - 130
• Main Authors: Aivaloglou, Efthimia, Hoepelman, David, Hermans, Felienne
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.09.2015
• Subjects: Arrays; Generators; Grammar; Indexes; Production; Spreadsheet programs; Syntactics
• DOI: 10.1109/SCAM.2015.7335408

Spreadsheets are ubiquitous in the industrial world and often perform a role similar to other computer programs, which makes them interesting research targets. However, there does not exist a reliable grammar that is concise enough to facilitate formula parsing and analysis and to support research on spreadsheet codebases. This paper presents a grammar for spreadsheet formulas that is compatible with the spreadsheet formula language, is compact enough to feasibly implement with a parser generator, and produces parse trees aimed at further manipulation and analysis. We evaluate the grammar against more than one million unique formulas extracted from the well known EUSES and Enron spreadsheet datasets, successfully parsing 99.99%. Additionally, we utilize the grammar to analyze these datasets and measure the frequency of usage of language features in spreadsheet formulas. Finally, we identify smelly constructs and uncommon cases in the syntax of formulas.