Wyniki wyszukiwania - BazTech

1

Tunnel parsing with counted repetitions

Handzhiyski Nikolay, Somova Elena

Computer Science

|

2020

|

T. 21 (4)

441-462

EN

This article describes a new and efficient algorithm for parsing (called tunnel parsing) that parses from left to right on the basis of context-free grammar without left recursion nor rules that recognize empty words. The algorithm is mostly applicable for domain-specific languages. In the article, particular attention is paid to the parsing of grammar element repetitions. As a result of the parsing, a statically typed concrete syntax tree is built from top to bottom, that accurately reflects the grammar. The parsing is not done through a recursion, but through an iteration. The tunnel parsing algorithm uses the grammars directly without a prior refactoring and is with a linear time complexity for deterministic context-free grammars.

2

Learning software for handling the mathematical expressions

Steingartner W., Yar-Muhamedov I.

Journal of Applied Mathematics and Computational Mechanics

|

2018

|

Vol. 17, nr 2

77--91

EN

Educating young software engineers and IT experts is a great challenge nowadays. Still new technologies are used in a practical approach and many of them come from formal methods. To help future software experts in the understanding of formal methods grounded in semantics, learning software that illustrates and visualizes important techniques seems to be very fruitful. In this paper, we present software, which handles the arithmetic and Boolean expressions, their analysis, evaluation, drawing the syntax tree and the other techniques with the expressions. This software is devoted as a teaching tool for teachers when explaining appropriate theory and for students for self-studying and making their own experiments. Furthermore, this software is an integral part of our software package for several semantic methods.

3

Algorytm sprawdzania kompletności danych w procesie ich wymiany między systemami informatycznymi przedsiębiorstw produkcyjnych z uwzględnieniem analizy składniowej

Pękala J.

Pomiary Automatyka Robotyka

|

2013

|

R. 17, nr 2

153-158

PL

W artykule przedstawiono koncepcję schematu sprawdzania kompletności danych po procesie ich transformacji opracowaną na potrzeby wymiany informacji pomiędzy różnymi systemami informatycznymi przetwarzającymi informacje w przedsiębiorstwie produkcyjnym. Scharakteryzowano pokrótce mechanizm konwersji informacji wykorzystywany podczas ich przepływu pomiędzy systemami informatycznymi przedsiębiorstwa. Opisano problematykę utraty części danych w trakcie ich przekształcania. Zaprezentowano opracowany algorytm a także wyniki działania programu go implementującego.

EN

The paper presents newest version of data completeness verification algorithm used in the process of its transformation elaborated for the information exchange between different systems in manufacturing company. Data conversion mechanism used in information flow between enterprise systems was characterized. Problems of data loss during the conversion process were described. Results of working of the program which implements the algorithm were presented.

4

On Some Crypto-messages Parser

Kurkowski M., Małek J., Orzechowski M.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

|

2006

|

Vol. 11

59--66

EN

Some methods of automatic verification of cryptographic protocols require creating specially designed formal languages based on suitable algebra of terms (called crypto-terms or crypto-messages). Sometimes in verification process it is essential to check whether a given crypto-term is a sub term of another one or in general whether some crypto-term belongs to the specified crypto-Language (a set of some crypto-terms) or not. Another problem is creating the set of all ant chains of subterms of a given term wit h respect to the order introduced by a subterm relation. The main goal of this paper is to present a tool for verification whether crypto-term belongs to the specified crypto-language or not. Our main purpose is to check lexical analysis and syntax analysis. Finally, after checking that a crypto-sentence is correct, we convert it into the special format, purpose was to check lexical analysis and syntax analysis. For our investigation Flex and Bison - the well known grammar tools – have been used. We believe that our tool will be usefull in research on the topic of symbolic verification of cryptographic protocols.