Method for calculating director symbols in a free context grammar

Authors

  • Guillermo Roberto Solarte Martínez docente
  • Luis Eduardo Muñoz Guerrero
  • Camilo Muñoz Albornoz

DOI:

https://doi.org/10.15665/rp.v18i2.2289

Abstract

The main objective of this investigation is to develop a method that allows the creator of languages to decide if the grammar fulfills the necessary and enough condition a so that a clean grammar is of the type LL [1] Specifying that the groups of managing symbols s corresponding to the different expansions of each symbol non terminal are disjoints. To reach this objective it is appropriate method to advance in several well differentiated aspects. First, the analysis and design of the application is approached inside the methodologies defined in the field of structures of data, programming languages, artificial intelligence, and algorithm. In second instance, it is important to stand out that an algorithm exists to determine this type of grammarians. To implement this algorithm in this tool it is followed a series of steps that you/they consume enough time of manual analysis sequentially; therefore the steps and the implicit algorithms of each one of them are systematized allowing to diminish the time of the analyses, to increase their efficiency and at the end to verify if the grammar is or not of that of type LL,[1] last .tor the tests carried out with different types of grammarians were overwhelming, satisfactory and they reflected the prospective results.

 

Published

2020-08-27