Programmars: A Revolution in Computer Language Parsing
Guardado en:
| Publicado en: | Proceedings of the International Conference on Software Engineering Research and Practice (SERP) (2015), p. 125-131 |
|---|---|
| Autor principal: | |
| Publicado: |
The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp)
|
| Acceso en línea: | Citation/Abstract Full Text Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Resumen: | This paper presents a revolutionary way to parse computer programming languages without a traditional grammar. The motivation behind this approach is to dramatically increase scalability. The intention is to be able to parse and analyze billions of lines of code written in hundreds of programming languages. To achieve that goal, it is advantageous to have sharable, open-source, modular ways for defining the syntax and semantics of programming languages. The new parsing technique replaces a traditional grammar with a computer program, referred to as a Programmar (short for program and grammar). All the basic operations in BNF (sequencing, alternation, optional terms, repeating and grouping) are supported, and the Java code is both sharable and modular. This parsing approach enables dozens or even hundreds of developers to work on computer program analysis concurrently, while avoiding many of the consistency issues encountered when building grammars and associated code analysis tools. |
|---|---|
| Fuente: | Advanced Technologies & Aerospace Database |