COKE
发表于 2025-3-27 00:49:24
https://doi.org/10.1007/b138054xtsensitivity of a grammar is defined on its derivations, and it is determined by the maximal length of the strings of ancestors of any symbol occurring at any position of the derived strings. A total recursive function f bounds the (right-) contextsensitivity function of grammar G, if for every ter
plasma-cells
发表于 2025-3-27 03:54:06
https://doi.org/10.1007/978-3-540-73410-9its main applications: we showed that two-level parsing by means of coarse structures can simplify the parsing process and that the concept of coarse structures can advantageously be used for syntax error recovery using global rather than local context of the error position.
jagged
发表于 2025-3-27 06:48:33
https://doi.org/10.1007/978-3-540-73410-9ethods recently introduced in graph theory. A class of pattern matching and replacement rules for graphs is specified, such that applications of rules in the class can readily be programmed as rapid transformations of record structures. When transformations of record structures are formalized as app
Mhc-Molecule
发表于 2025-3-27 09:59:07
http://reply.papertrans.cn/17/1662/166196/166196_34.png
BOLUS
发表于 2025-3-27 14:17:47
http://reply.papertrans.cn/17/1662/166196/166196_35.png
Phagocytes
发表于 2025-3-27 18:40:59
http://reply.papertrans.cn/17/1662/166196/166196_36.png
Foam-Cells
发表于 2025-3-28 00:42:17
Parsing and syntactic error recovery for context-free grammars by means of coarse structures,its main applications: we showed that two-level parsing by means of coarse structures can simplify the parsing process and that the concept of coarse structures can advantageously be used for syntax error recovery using global rather than local context of the error position.
Aggregate
发表于 2025-3-28 05:53:42
https://doi.org/10.1007/3-540-08342-1Automatentheorie; Languages; Semiotik; automata; calculus; complexity; data structures; optimization; progra
FECK
发表于 2025-3-28 08:06:52
http://reply.papertrans.cn/17/1662/166196/166196_39.png
pantomime
发表于 2025-3-28 11:36:14
https://doi.org/10.1007/978-3-540-73410-9The sequence equivalence problem for DOL systems is shown to be decidable. In an algebraic formulation the sequence equivalence problem for DOL systems can be stated as follows: Given homomorphisms h. and h. on a free monoid Σ* and a word σ from Σ*, is h.(σ)=h.(σ) for all n>0?