The syntax trees built by the parsers generated by Tunnel Grammar Studio are described in article "The Expressive Power of the Statically Typed Concrete Syntax Trees" published at "Proceedings of the 14th International Conference Education and Research in the Information Society" (ERIS 2021), Vol-3061, with ISSN 1613-0073. A PDF can be found into the download page here.

At 2022 Jan 02, 12:57 GMT in news channel Tunnel Parsing

The parsing machine architecture of the parsers generated by Tunnel Grammar Studio is described in article "A Parsing Machine Architecture Encapsulating Different Parsing Approaches" published in "International Journal on Information Technologies and Security", No.3 (vol. 13), 2021, pp. 27-38. Direct PDF link.

At 2021 Sep 01, 08:23 GMT in news channel Tunnel Parsing

Advanced details of the tunnel parsing algorithm, that is used in the generated parsers by Tunnel Grammar Studio, are available in an article "Tunnel Parsing with counted repetitions" with DOI:10.7494/csci.2020.21.4.3753. A PDF can be found into the download page here.

At 2021 Jun 30, 12:18 GMT in news channel Tunnel Parsing

The basics of the tunnel parsing algorithm are covered in an article in: 2019 book in the series of Springer Lecture Notes in Computer Science (LNCS), Volume 11950, 2021.

A DOI and a PDF link will be placed here, after are available.

At 2021 Jun 30, 12:12 GMT in news channel Tunnel Parsing

The result of a parsing process is often a Syntax Tree (ST). This is a tree, that represents the syntactic information extracted from the input during the parsing process.

Tunnel Grammar Studio generates Parsing Machines (PM) from Augmented Backus-Naur form grammars to a source code. The PM implements the visitor pattern for the ST construction. One way to use the PM is to inherit the visitor interface and at runtime to construct a custom ST. The second way is to generate an abstract or a concrete syntax tre… Read moree architect - an object that will construct automatically the ST as instances of object oriented classes. After the ST is complete, the client code can use it and free it on demand. The automatically generated ST are supporting iterative and recursive iterations, to string conversions and destructors.

The client may use the trees directly or write a code (glue code), that connects the automatically generated ST structures with the actual client program. This level of abstraction brings a lot of benefits in the development process, because changes to the language grammar may require only changes to the glue code, not to the whole client program.

For more information: Tunnel Grammar Studio

At 2019 Nov 17, 16:48 GMT in news channel Versions