01256nam 2200397 450 9900008217102033163-7643-5775-40082171USA010082171(ALEPH)000082171USA01008217120011221d1997----km-y0itay0103----baengCH||||||||001yyNew results in operstors theory and its applicationsthe Israel M. Glazman memorial volumeI. Gohberg, Yu. Lyubich editorsBaselBirkhäuserc1997VI, 257 p24 cmOperator theory advances and applications982001Operator theory advances and applications98Teoria degli operatoriGlazman, Israel M.515.724GOHBERG,IsraelLYUBICH,Yu.GLAZMAN,Israel M.ITsalbcISBD990000821710203316515.724 NEW10679 ING515.724BKTECPATTY9020011221USA01100820020403USA011728PATRY9020040406USA011657New results in operstors theory and its applications967085UNISA00556nam 2200169 i 450099100426922650753620230704153344.0230331s1982----it e 000 0 ita d Bibl. Dip.le Aggr. Scienze Giuridiche - Sez. Centro Studi sul RischioCorradini Broussard, Domenico121376Disuguali dialoghi /Domenico CorradiniPisa :ETS,c198279 p. ;24 cmMateriali didattici ETS ;23991004269226507536Disuguali dialoghi3377443UNISALENTO04089nam 22006255 450 991043758320332120200704030419.01-4471-5514-910.1007/978-1-4471-5514-0(CKB)3710000000024268(EBL)1538476(SSID)ssj0001120911(PQKBManifestationID)11711819(PQKBTitleCode)TC0001120911(PQKBWorkID)11170806(PQKB)11297013(DE-He213)978-1-4471-5514-0(MiAaPQ)EBC6311299(MiAaPQ)EBC1538476(Au-PeEL)EBL1538476(CaPaEBR)ebr10976346(OCoLC)861969130(PPN)17609704X(EXLCZ)99371000000002426820131016d2013 u| 0engur|n|---|||||txtccrFormal Languages and Compilation /by Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti2nd ed. 2013.London :Springer London :Imprint: Springer,2013.1 online resource (408 p.)Texts in Computer Science,1868-0941Description based upon print version of record.1-4471-5513-0 Introduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis.This fully revised and expanded new edition elucidates the elegance and simplicity of the fundamental theory underlying Formal Languages and Compilation. Retaining the reader-friendly, minimalist style of the first edition, this uniquely versatile textbook describes the essential principles and methods used for defining the syntax of artificial languages, and for designing efficient parsing algorithms and syntax-directed translators with semantic attributes. A comprehensive selection of topics is presented within a rigorous, unified framework, illustrated by numerous practical examples. Features and topics: Presents a novel conceptual approach to parsing algorithms that applies to extended BNF grammars, together with a parallel parsing algorithm (NEW) Supplies supplementary teaching tools, including course slides and exercises with solutions, at an associated website Unifies the concepts and notations used in different approaches, enabling an extended coverage of methods with a reduced number of definitions Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars Describes all algorithms in pseudocode, so that detailed knowledge of a specific programming language is not necessary Makes extensive usage of theoretical models of automata, transducers and formal grammars Includes concise coverage of algorithms for processing regular expressions and finite automata Introduces static program analysis based on flow equations This clearly-written, classroom-tested textbook is an ideal guide to the fundamentals of this field for advanced undergraduate and graduate students in computer science and computer engineering. Some background in programming is required, and readers should also be familiar with basic set theory, algebra and logic.Texts in Computer Science,1868-0941Logic, Symbolic and mathematicalMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Logic, Symbolic and mathematical.Mathematical Logic and Formal Languages.511.3Crespi Reghizzi Stefanoauthttp://id.loc.gov/vocabulary/relators/aut51848Breveglieri Lucaauthttp://id.loc.gov/vocabulary/relators/autMorzenti Angeloauthttp://id.loc.gov/vocabulary/relators/autMiAaPQMiAaPQMiAaPQBOOK9910437583203321Formal Languages and Compilation2504029UNINA