CS 320 : Formal Grammars Marco Gaboardi MSC 116 gaboardi@bu.edu Announcements • Thirdtheoryassignmentpostedsoon. From previous classes… BNF – Backus Normal/Naur Form • A grammar is defined by a set of terminals (tokens), a set of nonterminals, a designated nonterminal start symbol, and a finite nonempty set of rules ::= . ::= ::= a | an […]
程序代写代做代考 interpreter C compiler CS 320 : Formal Grammars Read More »
CS 320: Principles of Programming Languages Introduction, Class Structure, Logistics, and Objectives ‘- Marco Gaboardi (Fall 2019) and Assaf Kfoury (Spring 2020) What is your favorite language? ‘- Why is it your favorite? • Easy to program? • Good debugging environment? • Large amount of standard libraries? • Syntax? • Language you know the most?
This is an electronic version of the print textbook. Due to electronic rights restrictions, some third party content may be suppressed. Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. The publisher reserves the right to remove content from this title at any time if subsequent rights restrictions
Using Zoom for Lectures • Please mute both: • yourvideocamerasfortheentirelecture • youraudio/micsunlessaskingoransweringaquestion • Recommended Zoom configuration: • notfullscreen(double-clickanywheretoexitfullscreen) • side-by-side mode (see View options near the top of Zoom) • Asking/answering a question, option 1: • clickonParticipants • usethehandicontoraiseyourhand • Iwillcallonyouandaskyoutounmuteyourself • Asking/answering a question, option 2: • clickonChat • typeyourquestion,andIwillanswerit CS 320 : Scope
1. Stack/heap allocations and boxing 2. Traits 3. Generics Copyright By PowCoder代写 加微信 powcoder 4. From/Into 5. Dereferencing 6. Reference counting 7. Destructors 8. Traits and bounds 9. Option/Result composition 10. Iterators To explain things you may have used in HW 3 without fully understanding To better prepare you for HW 5 Stack and Heap
Model-Checking CS511 1/76 Program Correctness Model-Checking Introduction to Promela Assertion Based Model Checking Turnstile Example MEP End States 2/76 Program Correctness Main approaches to demonstrating that a program does what it’s supposed to do: 1. Testing 2. Deductive verification 3. Model-checking 3/76 Testing Fast and simple way to detect errors Can never be
Concurrent Programming CS511 1/41 (Lack of) Types Documenting Types using spec Tail Recursion Exceptions Control Structures 2/41 Erlang is Strongly Typed 1 2 3 4 5 1> 6+”1″. ** exception error: an error occurred when evaluating an arithmetic expression in operator +/2 called as 6 + “1” Good, but there is no static type-checking… 3/41
程序代写代做代考 Erlang kernel html compiler data structure Concurrent Programming Read More »
Monitors CS511 1/47 Review We’ve seen that semaphores are an efficient tool to solve synchronization problems However, they have some drawbacks 1. They are low-level constructs It is easy to forget an acquire or release 2. They are not related to the data They can appear in any part of the
程序代写代做代考 Java compiler C graph concurrency c# cache Monitors Read More »
Concurrent Programming CS511 1/49 About Erlang Functional language Concurrent/Distributed No shared memory (message passing) No types at compile time Dynamically typed Open source Developed in the 80s in Ericsson by Joe Armstrong, Robert Virding and Mike Williams 2/49 Runtime System Compiled code runs on a virtual machine
程序代写代做代考 Erlang kernel B tree compiler graph C html Concurrent Programming Read More »
Procedures Overview °C Functions °MIPS Instructions for Procedures °The Stack °Register Conventions °Another Example C functions main() { int i,j,k,m; i = mult(j,k); … m = mult(i,i); … } What information must ;compiler/programmer keep track of? /* really dumb mult function */ int mult (int mcand, int mlier){ int product; product = 0; while (mlier
程序代写代做代考 kernel mips compiler assembler C Procedures Read More »