Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Goodness criteria for programming language grammar rules
ACM SIGPLAN Notices
A preliminary study on various implementation approaches of domain-specific language
Information and Software Technology
AN UNSUPERVISED INCREMENTAL LEARNING ALGORITHM FOR DOMAIN-SPECIFIC LANGUAGE DEVELOPMENT
Applied Artificial Intelligence
A Case Study in Grammar Engineering
Software Language Engineering
Typed and unambiguous pattern matching on strings using regular expressions
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On the impact of DSL tools on the maintainability of language implementations
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Gramin: a system for incremental learning of programming language grammars
Proceedings of the 4th India Software Engineering Conference
Debugging applications created by a Domain Specific Language: The IPAC case
Journal of Systems and Software
Design and implementation of a language-complete C++ semantic graph
Proceedings of the 50th Annual Southeast Regional Conference
Comparison of context-free grammars based on parsing generated test data
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
A domain-specific language for context modeling in context-aware systems
Journal of Systems and Software
| Hi-index | 0.00 |
One approach to measuring and managing the complexity of software, as it evolves over time, is to exploit software metrics. Metrics have been used to estimate the complexity of the maintenance effort, to facilitate change impact analysis, and as an indicator for automatic detection of a transformation that can improve the quality of a system. However, there has been little effort directed at applying software metrics to the maintenance of grammar-based software applications, such as compilers, editors, program comprehension tools and embedded systems. In this paper, we adapt the software metrics that are commonly used to measure program complexity and apply them to the measurement of the complexity of grammar-based software applications. Since the behaviour of a grammar-based application is typically choreographed by the grammar rules, the measure of complexity that our metrics provide can guide maintainers in locating problematic areas in grammar-based applications. Copyright © 2004 John Wiley & Sons, Ltd.