000868387 000__ 04782cam\a2200481Ii\4500
000868387 001__ 868387
000868387 005__ 20230306145855.0
000868387 006__ m\\\\\o\\d\\\\\\\\
000868387 007__ cr\cn\nnnunnun
000868387 008__ 190502s2019\\\\sz\a\\\\ob\\\\001\0\eng\d
000868387 020__ $$a9783030048792$$q(electronic book)
000868387 020__ $$a3030048799$$q(electronic book)
000868387 020__ $$z9783030048785
000868387 0247_ $$a10.1007/978-3-030-04879-2$$2doi
000868387 035__ $$aSP(OCoLC)on1099660045
000868387 035__ $$aSP(OCoLC)1099660045
000868387 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dDKU
000868387 049__ $$aISEA
000868387 050_4 $$aQA267.3
000868387 08204 $$a005.13/1$$223
000868387 1001_ $$aCrespi-Reghizzi, Stefano,$$eauthor.
000868387 24510 $$aFormal languages and compilation /$$cStefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti.
000868387 250__ $$aThird edition.
000868387 264_1 $$aCham, Switzerland :$$bSpringer,$$c2019.
000868387 300__ $$a1 online resource (xiii, 499 pages) :$$billustrations.
000868387 336__ $$atext$$btxt$$2rdacontent
000868387 337__ $$acomputer$$bc$$2rdamedia
000868387 338__ $$aonline resource$$bcr$$2rdacarrier
000868387 4901_ $$aTexts in computer science,$$x1868-0941
000868387 504__ $$aIncludes bibliographical references and index.
000868387 50500 $$g1.$$tIntroduction:$$tIntended scope and readership ; Compiler parts and corresponding concepts --$$g2.$$tSyntax:$$tIntroduction ; Formal language theory ; Regular expressions and languages ; Linguistic abstraction : abstract and concrete lists ; Context-free generative grammars ; Grammars of regular languages ; Comparison of regular and context free languages ; More general grammars and language families --$$g3.$$tFinite automata as regular language recognizers:$$tIntroduction ; Recognition algorithms and automata ; Introduction to finite automata ; Deterministic finite automata ; Nondeterministic automata ; From automation to regular expression: BMC method ; Elimination of nondeterminism ; From regular expression to recognizer ; String matching of ambiguous regular expressions ; Expressions with complement and intersection ; Summary of relations between regular expressions, grammars and automata --$$g4.$$tPushdown automata and parsing:$$tIntroduction ; Pushdown automation ; Deterministic pushdown automata and languages ; Syntax analysis: top-down and bottom-up constructions ; Grammar as network of finite automata ; Bottom-up deterministic analysis ; Deterministic top-down parsing ; Operator-precedence grammars and parallel parsing ; Deterministic language families: a comparison ; Discussion of parsing methods ; A general parsing algorithm ; Managing syntactic errors and changes --$$g5.$$tTranslation semantics and static analysis:$$tIntroduction ; Translation relation and function ; Transliteration ; Purely syntactic translation ; Regular translation ; Semantic translation ; Static program analysis.
000868387 506__ $$aAccess limited to authorized users.
000868387 520__ $$aThis classroom-tested and clearly-written textbook presents a focused guide to the conceptual foundations of compilation, explaining the fundamental principles and algorithms used for defining the syntax of languages, and for implementing simple translators. This significantly updated and expanded third edition has been enhanced with additional coverage of regular expressions, visibly pushdown languages, bottom-up and top-down deterministic parsing algorithms, and new grammar models. Topics and features: Describes the principles and methods used in designing syntax-directed applications such as parsing and regular expression matching; Covers translations, semantic functions (attribute grammars), and static program analysis by data flow equations; Introduces an efficient method for string matching and parsing suitable for ambiguous regular expressions (NEW); Presents a focus on extended BNF grammars with their general parser and with LR(1) and LL(1) parsers (NEW); Introduces a parallel parsing algorithm that exploits multiple processing threads to speed up syntax analysis of large files Discusses recent formal models of input-driven automata and languages (NEW); Includes extensive use of theoretical models of automata, transducers and formal grammars, and describes all algorithms in pseudocode; Contains numerous illustrative examples, and supplies a large set of exercises with solutions at an associated website. --$$cProvided by publisher.
000868387 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed May 2, 2019).
000868387 650_0 $$aFormal languages.
000868387 650_0 $$aCompiling (Electronic computers)
000868387 7001_ $$aBreveglieri, Luca,$$eauthor.
000868387 7001_ $$aMorzenti, Angelo,$$eauthor.
000868387 830_0 $$aTexts in computer science.
000868387 852__ $$bebk
000868387 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-04879-2$$zOnline Access$$91397441.1
000868387 909CO $$ooai:library.usi.edu:868387$$pGLOBAL_SET
000868387 980__ $$aEBOOK
000868387 980__ $$aBIB
000868387 982__ $$aEbook
000868387 983__ $$aOnline
000868387 994__ $$a92$$bISE