Titlebook: Finite Representations of CCS and TCSP Programs by Automata and Petri Nets; Dirk A. Taubner Book 1989 Springer-Verlag Berlin Heidelberg 19

紅腫

表臉

繁忙

Rafael Mu?oz de Bustillo,José-Ignacio Antóne present book is to complement the preceding ones by including new developments of the theory and emphasizing the computations leading to results in quantum me978-0-387-90469-6978-1-4612-6066-0Series ISSN 0066-5452 Series E-ISSN 2196-968X

gimmick

等待

允許

Efficient non — Contextfree Parsing are governed by a new type of control mechanism. Each contextfree LL(k) — grammar is a PLL(k) — grammar. Important non — contextfree languages, e. g. declarative programming languages, can be described by PLL(k) — grammars. An algorithm for the syntactical check of PLL(k) — languages is developed a