20.500.12556/DKUM-87060 On parsing programming languages with Turing-complete parser A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language. Despite its computational power, it is meant to be used primarily for parsing programming and domain-specific languages. It enables a straightforward simulation of a number of existing parsing algorithms based on context-free grammars. The list includes both top-down shift-produce methods (such as SLL and LL) and bottom-up shift-reduce methods (such as LALR and LR), as well as mixed top-down-and-bottom-up methods such as LLLR. To justify the use of the new parsing method, the paper provides numerous examples of how a parser can actually be made in practice. It is advised that the main part of the parser is based on some simple well-established approach, e.g., SLL(1), while syntactically more complicated phrases can be parsed by exploiting the full power of the new parser. These phrases may either be extensions to the original language or some embedded domain-specific language. In all such and similar cases, no part of the language is restricted to be context-free. In fact, context-sensitive languages can be handled quite efficiently. Turing-complete parsing context-sensitive error recovery Turing-izračunljiva sintaksna analiza kontekstna odvisnost reševanje iz napak true false true MDPI Angleški jezik Slovenski jezik Znanstveno delo 2024-02-14 09:03:01 2024-02-14 09:31:10 2024-05-23 08:49:29 0000-00-00 00:00:00 2023 0 0 Str. 1-27 Št. 7, št. članka 1594 Letn. 11 Apr. 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2023-01-31 2023-03-23 2023-03-25 004 147237123 10.3390/math11071594 2227-7390 Slivnik-2023-On_Parsing_Programming_Languages.pdf Slivnik-2023-On_Parsing_Programming_Languages.pdf 1 602B3D7FBE119737EEB9DBB9CF7FC463 949fe69a3f2711032eb752c3648124c653bcd2a561354c28f08076fc03b2b563 2cae4de8-cb13-11ee-9f39-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=176134 https://doi.org/10.3390/math11071594 0 7a4b4890-cb0f-11ee-9f39-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=176133 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0