Search

The main objective of this investigation is to develop a method that allows the creator of languages to decide if the grammar fulfills with the necessary and enough condition for that a clean grammar be of the type LL1 specifying that the groups of managing symbols corresponding to the different expansions of each symbol non terminal are disjointed. To reach this objective it is methodologically appropriate 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 highlight that an algorithm exists to determine this type of grammarians. To implement this algorithm in this tool a series of steps are followed sequentially that consume enough time of manual analysis; therefore, the steps and the implicit algorithms of each one 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 is not of type LL1, finally the tests carried out with different types of grammarians were convincing, satisfactory and they reflected the expected results. [ABSTRACT FROM AUTHOR]

The main objective of this investigation is to develop a method that allows the creator of languages to decide if the grammar fulfills with the necessary and enough condition for that a clean grammar be of the type LL1 specifying that the groups of managing symbols corresponding to the different expansions of each symbol non terminal are disjointed. To reach this objective it is methodologically appropriate 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 highlight that an algorithm exists to determine this type of grammarians. To implement this algorithm in this tool a series of steps are followed sequentially that consume enough time of manual analysis; therefore, the steps and the implicit algorithms of each one 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 is not of type LL1, finally the tests carried out with different types of grammarians were convincing, satisfactory and they reflected the expected results. [ABSTRACT FROM AUTHOR]

The main objective of this investigation is to develop a method that allows the creator of languages to decide if the grammar fulfills with the necessary and enough condition for that a clean grammar be of the type LL1 specifying that the groups of managing symbols corresponding to the different expansions of each symbol non terminal are disjointed. To reach this objective it is methodologically appropriate 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 highlight that an algorithm exists to determine this type of grammarians. To implement this algorithm in this tool a series of steps are followed sequentially that consume enough time of manual analysis; therefore, the steps and the implicit algorithms of each one 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 is not of type LL1, finally the tests carried out with different types of grammarians were convincing, satisfactory and they reflected the expected results. [ABSTRACT FROM AUTHOR]