APPLICATION OF ALGORITHMIC ALGEBRA SYSTEM FOR GRAMMATICAL ANALYSIS OF SYMBOLIC COMPUTATION EXPRESSIONS OF PROPOSITIONAL LOGIC

Authors

  • V. V. Lytvyn Lviv Polytechnic National University, Lviv, Ukraine, Ukraine
  • I. O. Bobyk Lviv Polytechnic National University, Lviv, Ukraine, Ukraine
  • V. A. Vysotska Lviv Polytechnic National University, Lviv, Ukraine, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2016-4-10

Keywords:

text, a Ukrainian, algorithm, content monitoring, keywords, linguistic analysis, parsing, generative grammar, structured scheme sentences, information linguistic system.

Abstract

The architecture and implemented a software system parsing schemes of algebraic algebra and their interpretation. The software system
allows to generate automated in such schemes create a program and debug the relevant schemes. A clear division of algebraic algebra into
separate modules is defined, each of which will be characterized by its functional load. The methods of parsing for the development and
presentation of grammar such schemes are used. Automatic transforming it in a list form is implemented. A machine system of algebraic algebra as an abstract interpretation of the mechanism of grammar parser is defined. The vocabulary V consists of finite not empty set of lexical units. The expression on V is a finite-length string of lexical units with V. An empty string does not contain lexical items and is denoted by Λ. The set of all lexical units over V is denoted as V ′. The language over V is a subset V ′. The language displayed through the set of all lexical units of language or through definition criteria, which should satisfy lexical items that belong to the language. Another is one important method to set the language through the use of generative grammar. The grammar consists of a lexical units set of various types and the rules or productions set of expression constructing. Grammar has a vocabulary V, which is the set of lexical units for language expressions building. Some of lexical units of vocabulary (terminal) can not be replaced by other lexical units. The text realizes structural submitted activities through provides subject, object, process, purpose, means and results that appear in content, structural, functional and communicative criteria and parameters.
The units of internal organization of the text structure are alphabet, vocabulary (paradigmatics), grammar (syntagmatic) paradigm, paradigmatic relations, syntagmatic relation, identification rules, expressions, unity between phrasal, fragments and blocks. On the compositional level are isolated sentences, paragraphs, sections, chapters, under the chapter, page etc. that (except the sentence) indirectly related to the internal structure because are not considered. With the help of a database (database for terms/morphemes and structural parts of speech) and defined rules of text analysis searching terms. Parsers operate in two stages: lexemes content identifying and a parsing tree creates.

References

Глушков В. Методы символьной мультиобработки / В. Глушков, Г. Цейтлин, Е. Ющенко. – К. : Наук. думка, 1980. – 252 с. 2. Глушков В. Алгебра. Языки. Программирование / В. Глушков, Г. Цейтлин, Е. Ющенко. – К. : Наук. думка, 1989. – 376 с. 3. Цейтлин Г. Введение в алгоритмику / Г. Цейтлин. – К. : Фара, 1999. – 310 с. 4. Цейтлин Г. Алгебры Глушкова и теория клонов / Г. Цейтлин // Кибернетика и системный анализ. – 2003. – № 4. – С. 48–58. 5. Цейтлин Г. Структурное программирование задач символьной мультиобработки / Г. Цейтлин // Кибернетика. – 1983. – № 5. – С. 22–30. 6. Цейтлин Г. Распараллеливание алгоритмов сортировки / Г. Цейтлин // Кибернетика. – 1989. – № 6. – С. 67–74. 7. Цейтлин Г. Проектирование последовательных алгоритмов сортировки / Г. Цейтлин // Программирование. – 1989. – № 3. – С. 3–21. 8. Многоуровневое структурное проектирование программ: Теоретические основы, инструментарий / [Е. Ющенко, Г. Цейтлин, В. Грицай, Т. Терзян]. – М. : Финансы и статисти- ка, 1989. – 208 с. 9. Калужнин Л. Об алгоритмизации математических задач / Л. Калужнин // Пробл. кибернетики. – 1959. – Вып. 2. – С. 51–69. 10. Мартинюк Т. Методи та засоби паралельних перетворень векторних масивів даних / Т. Мартинюк, B. Хом’юк. – В. : УНІВЕРСУМ-Вінниця, 2005. – 203 с. 11. Дорошенко А. О методе проектирования абстрактного типа данных в алгебре алгоритмики / А. Дорошенко, О. Иовчев // Проблеми програмування. – 2012. – № 1. – С. 3–16. 12. Акуловский В. Некоторые аспекты формализации архитектурного этапа разработки алгоритмов / В. Акуловский // Проблеми програмування. – 2009. – № 2. – С. 3–11. 13. Алгеброалгоритмические модели и методы параллельного программирования / [Ф. Андон, А. Дорошенко, Г. Цейтлин, Е. Яценко]. – К. : Академпериодика, 2007. – 634 с. 14. Иовчев В. Инструментальные средства алгебры алгоритмики на платформе WEB 2.0 / В. А. Иовчев, А. С. Мохница // Проблеми програмування. – 2010. – № 2–3. – С. 547–556.

Downloads

How to Cite

Lytvyn, V. V., Bobyk, I. O., & Vysotska, V. A. (2017). APPLICATION OF ALGORITHMIC ALGEBRA SYSTEM FOR GRAMMATICAL ANALYSIS OF SYMBOLIC COMPUTATION EXPRESSIONS OF PROPOSITIONAL LOGIC. Radio Electronics, Computer Science, Control, (4). https://doi.org/10.15588/1607-3274-2016-4-10

Issue

No. 4 (2016): Radio Electronics, Computer Science, Control

Section

Progressive information technologies

License

Copyright (c) 2017 V. V. Lytvyn, I. O. Bobyk, V. A. Vysotska

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Creative Commons Licensing Notifications in the Copyright Notices

The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.

The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.

The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.