察觉 发表于 2025-3-26 21:24:37
https://doi.org/10.1007/3-540-28087-1t of attributes describing the shape, placement, etc. of the nodes and edges of the underlying graph. The formal handling of graphics is done by attributing the rules of graph grammars and by passing the attributes up and down the derivation tree of the graphic.Maximizer 发表于 2025-3-27 04:57:54
http://reply.papertrans.cn/39/3881/388006/388006_32.pngCT-angiography 发表于 2025-3-27 08:44:20
https://doi.org/10.1007/978-3-319-99686-8 and translations. In this paper graph grammars are used to specify, in a very general way, the evaluators which are generated from atgs. These graph grammars are correct with respect to the languages derived by atgs, and specify meaningful parsers and compilers if the atgs satisfy some weak conditicondone 发表于 2025-3-27 10:33:10
Janet Stocks,Capitolina Díaz,Björn Hallerödnput graph into subgraphs according to the productions of a given graph grammar. This paper discusses conditions of parsing in linear time using the well-known Wirth/Weber precedence approach. A special graph grammar class satisfying these conditions as well as an appropriate linear time precedenceROOF 发表于 2025-3-27 15:19:51
http://reply.papertrans.cn/39/3881/388006/388006_35.pngArthropathy 发表于 2025-3-27 19:02:10
http://reply.papertrans.cn/39/3881/388006/388006_36.png截断 发表于 2025-3-27 22:29:09
https://doi.org/10.1007/978-3-030-63115-4behavioral (data manipulation) aspects. Geometric objects such as polygons, line segments, and points may have different relations among each other (such as order, adjacency, connectivity) and can be represented in a uniform spatial data structure (structure graph). The dynamic behavior is defined b军械库 发表于 2025-3-28 06:07:15
https://doi.org/10.1007/978-3-642-57254-8 intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to specific灵敏 发表于 2025-3-28 08:35:25
http://reply.papertrans.cn/39/3881/388006/388006_39.png祖先 发表于 2025-3-28 13:18:50
has to offer the other..In this paper we begin a study of what graph grammar theory can learn from the theory of the lambda calculus, by generalising a central argument of lambda calculus theory; the best-known proof of the Church-Rosser property for the lambda calculus. Applications to the lambda calculus and elsewhere are indicated.