Back to Basics: The Structure of a Program Bob Steagall CppCon 2020 K E W B C O M P U T I N GCopyright © 2020 Bob Steagall K E W B C O M P U T I N G Overview • The process of building a program • What rule (ODR) • Storage duration • ABIs and name-mangling • Linking and loading CppCon 2020 - The Structure of a Program 2Copyright © 2020 Bob Steagall K E W B C O M P U T I N G Goals • Describe a few important CppCon 2020 - The Structure of a Program 3Copyright © 2020 Bob Steagall K E W B C O M P U T I N G Building and Running a C++ Program • 50,000 ft view CppCon 2020 - The Structure of a Program 4 Input

1 SCIENCE PASSION TECHNOLOGY Introduction to Scientific Writing 01 Structure of Scientific Papers Matthias Boehm Graz University of Technology, Austria Institute of Interactive Systems and Data Science Technology, WS 2020/21 Agenda  Data Management Group  Course Organization, Outline, and Projects  Structure of Scientific Papers  Paper Project Proposals 4 706.015 Introduction to Scientific Writing – and Overview Matthias Boehm, Graz University of Technology, WS 2020/21 Outline Lectures  01 Structure of Scientific Papers [Oct 28, 6.15pm, optional]  02 Scientific Reading and Writing [Nov 04, 6pm

language Haskell 2010. Contents I The Haskell 2010 Language 1 1 Introduction 3 1.1 Program Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 The Haskell . . . . . . . . . 4 2 Lexical Structure 7 2.1 Notational Conventions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 Lexical Program Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 5 Modules 61 5.1 Module Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 5.2 Export Lists

Package Manager . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Lexical Structure 7 2.1 Symbols and Commands . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Reference Manual, Release 3.3.0 6 Chapter 1. Using Lean CHAPTER TWO LEXICAL STRUCTURE This section describes the detailed lexical structure of the Lean language. Many readers will want to skip this section currently only being used for some set_option values. decimal ::= [0-9]+ "." [0-9]+ 8 Chapter 2. Lexical Structure The Lean Reference Manual, Release 3.3.0 2.6 Quoted Symbols In a fixed set of commands (notation

sizeof(Class Object)  sizeof applied to the HR class yields the same result as sizeof applied to this structure: enum { HR_max = 16383 }; extern size_t HR_num_dispatched; struct HR_type { Employee *emps[HR_max]; enumeration nested inside a C structure.  However, C doesn’t consider nested enumeration types and constants to be members of the structure. They have the same scope as the structure name.  Storage for static and Daniel Saks 22 23Class Layout Copyright © 2020 by Stephen C. Dewhurst and Daniel Saks 10 Lexical vs. Physical Ordering  Note that language constructs that enforce an ordering on members are defined

and where . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 3.15 Lexical Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 identifier (like , ?, , or , for example). It is therefore necessary to have spaces between most lexical units. Many mathematical symbols can be typed using the corresponding LaTeX command names. For instance fibfact m in aux (pred n) where pred : Nat → Nat pred zero = zero pred (suc m) = m 3.15 Lexical Structure Agda code is written in UTF-8 encoded plain text files with the extension .agda. Most unicode

and where . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 3.15 Lexical Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 identifier (like , ?, , or , for example). It is therefore necessary to have spaces between most lexical units. Many mathematical symbols can be typed using the corresponding LaTeX command names. For instance fibfact m in aux (pred n) where pred : Nat → Nat pred zero = zero pred (suc m) = m 3.15 Lexical Structure Agda code is written in UTF-8 encoded plain text files with the extension .agda. Most unicode

and where . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 3.15 Lexical Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 identifier (like , ?, , or , for example). It is therefore necessary to have spaces between most lexical units. Many mathematical symbols can be typed using the corresponding LaTeX command names. For instance fibfact m in aux (pred n) where pred : Nat → Nat pred zero = zero pred (suc m) = m 3.15 Lexical Structure Agda code is written in UTF-8 encoded plain text files with the extension .agda. Most unicode

and where . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 3.15 Lexical Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 pred (g m) + h m in aux (pred n) where pred : Nat → Nat pred zero = zero pred (suc m) = m Lexical Structure Agda code is written in UTF-8 encoded plain text files with the extension .agda. Most unicode In the example above the whitespace around + is required, since 1+2 is a valid name. 3.15. Lexical Structure 45 Agda Documentation, Release 2.5.2 Qualified names are used to refer to entities defined