Resultados de búsqueda - (complex OR complejo) syntax
-
1
-
2
-
3
Software testing techniques
London : International Thompsom Computer Press, c1990Tabla de Contenidos: “…The taxonomy of bugs -- Flowgraphs and path testing -- Transaction-flow testing -- Data-flow testing -- Domain testing -- Metrics and complexity -- Paths, path products, and regular expressions -- Syntax testing -- Logic-based testing -- States, state graphs, and transition testing -- graph matrices and applications -- Implementation.…”
Consultar en el Cátalogo
Libro -
4
Software testing techniques
London : International Thompsom Computer Press, c1990Tabla de Contenidos: “…The taxonomy of bugs -- Flowgraphs and path testing -- Transaction-flow testing -- Data-flow testing -- Domain testing -- Metrics and complexity -- Paths, path products, and regular expressions -- Syntax testing -- Logic-based testing -- States, state graphs, and transition testing -- graph matrices and applications -- Implementation.…”
Consultar en el Cátalogo
Libro -
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
Programming languages : principles and paradigms
Londres : Springer-Verlag, 2010Tabla de Contenidos: “…1 Abstract Machines -- 1.1 The Concepts of Abstract Machine and of Interpreter -- 1.1.1 The Interpreter -- 1.1.2 An Example of an Abstract Machine: The Hardware Machine -- 1.2 Implementation of a Language -- 1.2.1 Implementation of an Abstract Machine -- 1.2.2 Implementation: The Ideal Case -- 1.2.3 Implementation: The Real Case and The Intermediate Machine -- 1.3 Hierarchies of Abstract Machines -- 1.4 Chapter Summary -- 1.5 Bibliographic Notes -- 1.6 Exercises -- References -- 2 How to Describe a Programming Language -- 2.1 Levels of Description -- 2.2 Grammar and Syntax -- 2.2.1 Context-Free Grammars -- 2.3 Contextual Syntactic Constraints -- 2.4 Compilers -- 2.5 Semantics -- 2.6 Pragmatics -- 2.7 Implementation -- 2.8 Chapter Summary -- 2.9 Bibliographical Notes -- 2.10 Exercises -- References -- 3 Foundations -- 3.1 The Halting Problem -- 3.2 Expressiveness of Programming Languages -- 3.3 Formalisms for Computability -- 3.4 There are More Functions than Algorithms -- 3.5 Chapter Summary -- 3.6 Bibliographical Notes -- 3.7 Exercises References -- 4 Names and The Environment -- 4.1 Names and Denotable Objects -- 4.1.1 Denotable Objects -- 4.2 Environments and Blocks -- 4.2.1 Blocks -- 4.2.2 Types of Environment -- 4.2.3 Operations on Environments -- 4.3 Scope Rules -- 4.3.1 Static Scope -- 4.3.2 Dynamic Scope -- 4.3.3 Some Scope Problems -- 4.4 Chapter Summary -- 4.5 Bibliographical Notes -- 4.6 Exercises -- References -- 5 Memory Management -- 5.1 Techniques for Memory Management -- 5.2 Static Memory Management -- 5.3 Dynamic Memory Management Using Stacks -- 5.3.1 Activation Records for In-line Blocks -- 5.3.2 Activation Records for Procedures -- 5.3.3 Stack Management -- 5.4 Dynamic Management Using a Heap -- 5.4.1 Fixed-Length Blocks -- 5.4.2 Variable-Length Blocks -- 5.5 Implementation of Scope Rules -- 5.5.1 Static Scope: The Static Chain -- 5.5.2 Static Scope: The Display -- 5.5.3 Dynamic Scope: Association Lists and CRT -- 5.6 Chapter Summary -- 5.7 Bibliographic Notes -- 5.8 Exercises -- References -- 6 Control Structure -- 6.1 Expressions -- 6.1.1 Expression Syntax -- 6.1.2 Semantics of Expressions -- 6.1.3 Evaluation of Expressions -- 6.2 The Concept of Command -- 6.2.1 The Variable -- 6.2.2 Assignment -- 6.3 Sequence Control Commands -- 6.3.1 Commands for Explicit Sequence Control -- 6.3.2 Conditional Commands -- 6.3.3 Iterative Commands -- 6.4 Structured Programming -- 6.5 Recursion -- 6.5.1 Tail Recursion -- 6.5.2 Recursion or Iteration? …”
Consultar en el Cátalogo
Libro -
14
Programming languages : principles and paradigms
Londres : Springer-Verlag, 2010Tabla de Contenidos: “…1 Abstract Machines -- 1.1 The Concepts of Abstract Machine and of Interpreter -- 1.1.1 The Interpreter -- 1.1.2 An Example of an Abstract Machine: The Hardware Machine -- 1.2 Implementation of a Language -- 1.2.1 Implementation of an Abstract Machine -- 1.2.2 Implementation: The Ideal Case -- 1.2.3 Implementation: The Real Case and The Intermediate Machine -- 1.3 Hierarchies of Abstract Machines -- 1.4 Chapter Summary -- 1.5 Bibliographic Notes -- 1.6 Exercises -- References -- 2 How to Describe a Programming Language -- 2.1 Levels of Description -- 2.2 Grammar and Syntax -- 2.2.1 Context-Free Grammars -- 2.3 Contextual Syntactic Constraints -- 2.4 Compilers -- 2.5 Semantics -- 2.6 Pragmatics -- 2.7 Implementation -- 2.8 Chapter Summary -- 2.9 Bibliographical Notes -- 2.10 Exercises -- References -- 3 Foundations -- 3.1 The Halting Problem -- 3.2 Expressiveness of Programming Languages -- 3.3 Formalisms for Computability -- 3.4 There are More Functions than Algorithms -- 3.5 Chapter Summary -- 3.6 Bibliographical Notes -- 3.7 Exercises References -- 4 Names and The Environment -- 4.1 Names and Denotable Objects -- 4.1.1 Denotable Objects -- 4.2 Environments and Blocks -- 4.2.1 Blocks -- 4.2.2 Types of Environment -- 4.2.3 Operations on Environments -- 4.3 Scope Rules -- 4.3.1 Static Scope -- 4.3.2 Dynamic Scope -- 4.3.3 Some Scope Problems -- 4.4 Chapter Summary -- 4.5 Bibliographical Notes -- 4.6 Exercises -- References -- 5 Memory Management -- 5.1 Techniques for Memory Management -- 5.2 Static Memory Management -- 5.3 Dynamic Memory Management Using Stacks -- 5.3.1 Activation Records for In-line Blocks -- 5.3.2 Activation Records for Procedures -- 5.3.3 Stack Management -- 5.4 Dynamic Management Using a Heap -- 5.4.1 Fixed-Length Blocks -- 5.4.2 Variable-Length Blocks -- 5.5 Implementation of Scope Rules -- 5.5.1 Static Scope: The Static Chain -- 5.5.2 Static Scope: The Display -- 5.5.3 Dynamic Scope: Association Lists and CRT -- 5.6 Chapter Summary -- 5.7 Bibliographic Notes -- 5.8 Exercises -- References -- 6 Control Structure -- 6.1 Expressions -- 6.1.1 Expression Syntax -- 6.1.2 Semantics of Expressions -- 6.1.3 Evaluation of Expressions -- 6.2 The Concept of Command -- 6.2.1 The Variable -- 6.2.2 Assignment -- 6.3 Sequence Control Commands -- 6.3.1 Commands for Explicit Sequence Control -- 6.3.2 Conditional Commands -- 6.3.3 Iterative Commands -- 6.4 Structured Programming -- 6.5 Recursion -- 6.5.1 Tail Recursion -- 6.5.2 Recursion or Iteration? …”
Consultar en el Cátalogo
Libro -
15
-
16
Haskell : the craft of functional programming
Harlow : Pearson Education, c2011Tabla de Contenidos: “…-- 19.3 Shallow and deep Embeddings -- 19.4 A DSL for regular expressions -- 19.5 Monadic DSLs -- 19.6 DSLs for computation: generating data in QuickCheck -- 19.7 Taking it further -- 20 Time and space behaviour -- 20.1 Complexity of functions -- 20.2 The complexity of calculations -- 20.3 Implementations of sets -- 20.4 Space behaviour -- 20.5 Folding revisited -- 20.6 Avoiding recomputation: memoization -- 21 Conclusion -- Appendices -- A. …”
Consultar en el Cátalogo
Libro -
17
Haskell : the craft of functional programming
Harlow : Pearson Education, c2011Tabla de Contenidos: “…-- 19.3 Shallow and deep Embeddings -- 19.4 A DSL for regular expressions -- 19.5 Monadic DSLs -- 19.6 DSLs for computation: generating data in QuickCheck -- 19.7 Taking it further -- 20 Time and space behaviour -- 20.1 Complexity of functions -- 20.2 The complexity of calculations -- 20.3 Implementations of sets -- 20.4 Space behaviour -- 20.5 Folding revisited -- 20.6 Avoiding recomputation: memoization -- 21 Conclusion -- Appendices -- A. …”
Consultar en el Cátalogo
Libro -
18
-
19