Multi level recursive specifications for context free grammars

  • Authors:
  • Vasile Craciunean;Cristina Aron;Ralf Fabian;Daniel Hunyadi

  • Affiliations:
  • Dept. of Computer Science and Economic Informatics, Univ. "Lucian Blaga", Sibiu, Romania;Dept. of Computer Science and Economic Informatics, Univ. "Lucian Blaga", Sibiu, Romania;Dept. of Computer Science and Economic Informatics, Univ. "Lucian Blaga", Sibiu, Romania;Dept. of Computer Science and Economic Informatics, Univ. "Lucian Blaga", Sibiu, Romania

  • Venue:
  • ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The support for the material presented in this paper was waved around two fundamental concepts: on one hand, the programming language concept regarded as an object that should be formally specified, and on the other hand, the concept of heterogeneous algebraic structure HAS, regarded as a specification mechanism. Also programming languages are probably one of the most studied objectives of computing techniques; they raise problems for computers designers and users, as the concept of programming language has not reached yet the maturity necessary to a mathematical object. Its different aspects constitute a study objective since the beginning of computers age. But the study method is more engineering, without a mathematical base.