abstract syntax can make the definition of modelica less
play

Abstract Syntax Can Make the Definition of Modelica Less Abstract - PowerPoint PPT Presentation

Sep 14, 2023 •484 likes •654 views

Abstract Syntax Can Make the Definition of Modelica Less Abstract 1st International Workshop on Equation-Based Object-Oriented Languages and Tools Berlin July 30, 2007 David Broman and Peter Fritzson Linkping University, Sweden

  1. Abstract Syntax Can Make the Definition of Modelica Less Abstract 1st International Workshop on Equation-Based Object-Oriented Languages and Tools Berlin July 30, 2007 David Broman and Peter Fritzson Linköping University, Sweden {davbr,petfr}@ida.liu.se Linköping University David Broman, davbr@ida.liu.se

  2. 2 Outline of the Talk Part I - Why are specification improvements needed? Specification Goals and Problems Part II - What to specify? Part III - How to specify? Previous Different Rejection Transformation Attempts Approaches Aspect Aspect Abstract Syntax Approach Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  3. 3 Part I Why are specification improvements needed? Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  4. 4 Problem: Interpreting the specification Interpretation of syntax and semantics Simulation Tool Modelica Language Specification � Dymola � Modelica System Designer Problem � MOSILAB - The Modelica Specification is open for interpretation � SimulationX - May result in incorrect and incompatible tools � OpenModelica Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  5. 5 Specification goals Unambigious "Can only be interpreted in exactly one way" Understandable "Easy to grasp with moderate computer science knowledge" Expressive "State the syntax and semantics in a compact manner" Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  6. 6 An evolutionary "middle-way" strategy Revolutionary Strategy Very large specification. Evolutionary Strategy . Abstract Syntax Approach Formal approach Informal approach e.g. operational semantics e.g. natural language text Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  7. 7 Part II What to specify? Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  8. 8 What should be specified? Syntax Semantics - the structure - the meaning R L sineVoltage R=10 L=1 Inertia1 k=1 spring E... c=1 J=0.1 1. Transformation Aspect G world y revolute r={L1,0,0} r={L2,0,0} a b b a b a b a bodyBox bodyBox1 n={0,0,1} n={0,0,1} x actuatedRev... Modelica Model Simulation Result R L sineVoltage R=10 L=1 Inertia1 k=1 spring E... c=1 2. Rejection Aspect J=0.1 G world y revolute r={L1,0,0} r={L2,0,0} a b b a b a b a bodyBox bodyBox1 n={0,0,1} n={0,0,1} x actuatedRev... Modelica Model Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  9. 9 Transformation Aspect What is actually the result of an execution? R L sineVoltage R=10 L=1 Inertia1 k=1 spring E... c=1 J=0.1 G world y revolute r={L1,0,0} r={L2,0,0} a b b a b a b a bodyBox bodyBox1 n={0,0,1} n={0,0,1} x actuatedRev... Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  10. 10 Rejection Aspect What is actually a valid Modelica model? R L R=10 L=1 sineVoltage Inertia1 k=1 spring E ... c=1 J=0.1 G world y revolute r={L1,0,0} r={L2,0,0} a b b a b a b a bodyBox bodyBox1 n={0,0,1} n={0,0,1} x actuatedRev... Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  11. 11 Part III How to specify? Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  12. 12 Previous Specification Attempts Types in Modelica Instance Creation (Elaboration) (Broman, Fritzson & Furic, 2006) (Mauss, 2005) - Only transformation aspect - Clarify the type concept in Modelica - Subset of the language - Concerns only the rejection aspect RML and Natural Semantics Modelica Specification (Kågedal & Fritzson, 1998) (Modelica Association, 2005) - 1998, large subset of specfication - Informal semantics, natural language - hard to get an overview of - became very large - Concrete syntax - now the code base for OpenModelica Formal approach Informal approach Abstract Syntax e.g. operational semantics e.g. natural language text Approach Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  13. 13 Abstract Syntax as a Middle-Way Strategy Elaboration (transformation and rejection aspects) � Input: Implicitly specified using concrete syntax Scanning, Parsing => � Output: Not specified � Abstract Syntax Tree (AST) Transformation: Informally specified using natural language Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  14. 14 Transformation and Rejection Aspects Rejection Aspect Transformation Aspect � � More restrictive than the concrete Precise specification of input syntax grammar and output (grammar) � � Include context sensitive information Transformation still informal � Still need informal rules (e.g. type rules) Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  15. 15 Example of a grammar fragment (S-AST) Modelica specification about connectors: "No equations are allowed in the definition or in any of its components" Key points � Extended BNF style � States allowed local class types and component types � States allowed prefixes � Meta-variables, declarative context-sensitive information � Verbose - intended for specification, not implementation Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

  16. 16 Concluding Summary How to specify What to specify Specification Goals � Current specification is � � Transformation Unambiguous informal, e.g. open for aspects � Understandable interpretation � Rejection aspects � Expressive � Evolutionary "middle-way" approach Abstract Syntax Approach Next Step � Specify INPUT and OUTPUT using grammars � Needs to be accepted � Complements the informal semantics by Modelica Association as the fundamental approach. � Yet another "specification" of a subset is less meaningful Thanks for listening! � There can only be one specification... Part I Part II Part III Why are specification What to specify? How to specify? Linköping University improvements needed? David Broman, davbr@ida.liu.se

Recommend

Abstract Syntax Aslan Askarov aslan@cs.au.dk Revised from slides by E. Ernst Abstract syntax

Abstract Syntax Aslan Askarov aslan@cs.au.dk Revised from slides by E. Ernst Abstract syntax

Compilation 2014 Abstract Syntax Aslan Askarov aslan@cs.au.dk Revised from slides by E. Ernst Abstract syntax High-level source Pretty printing code Abstract syntax tree Lexing/Parsing Elaboration Lowering Code generation

374 views • 18 slides
Abstract Syntax Trees 27 February 2019 OSU CSE 1 Abstract Syntax Tree An abstract syntax

Abstract Syntax Trees 27 February 2019 OSU CSE 1 Abstract Syntax Tree An abstract syntax

Abstract Syntax Trees 27 February 2019 OSU CSE 1 Abstract Syntax Tree An abstract syntax tree (AST) is a tree model of an entire program or a certain program structure (e.g., a statement or an expression in a Java program) An

538 views • 18 slides
Modeling Structural - Dynamics Systems in MODELICA/Dymola, MODELICA/Mosilab and AnyLogic Felix

Modeling Structural - Dynamics Systems in MODELICA/Dymola, MODELICA/Mosilab and AnyLogic Felix

Modeling Structural - Dynamics Systems in MODELICA/Dymola, MODELICA/Mosilab and AnyLogic Felix Breitenecker, Gnther Zauner, Daniel Leitner Working task Given: The problem definition of the constrained pendulum like in ARGESIM Comparison

353 views • 17 slides
Syntax and Grammars 1 / 21 Outline What is a language? Abstract syntax and grammars Abstract

Syntax and Grammars 1 / 21 Outline What is a language? Abstract syntax and grammars Abstract

Syntax and Grammars 1 / 21 Outline What is a language? Abstract syntax and grammars Abstract syntax vs. concrete syntax Encoding grammars as Haskell data types What is a language? 2 / 21 What is a language? Language : a system of

429 views • 21 slides
10/17/2011 Dynamic Semantics Definition of a (programming) language involves: Generic Language

10/17/2011 Dynamic Semantics Definition of a (programming) language involves: Generic Language

10/17/2011 Dynamic Semantics Definition of a (programming) language involves: Generic Language Technology (2IS15) abstract syntax, so-called signature concrete syntax: Dynamic Semantics textual syntax graphical syntax dr. Suzana

262 views • 4 slides
Syntax Liam OConnor CSE, UNSW (and data61) Term3 2019 1 Abstract Syntax Parsing Bindings

Syntax Liam OConnor CSE, UNSW (and data61) Term3 2019 1 Abstract Syntax Parsing Bindings

Abstract Syntax Parsing Bindings First Order Abstract Syntax Higher Order Abstract Syntax Syntax Liam OConnor CSE, UNSW (and data61) Term3 2019 1 Abstract Syntax Parsing Bindings First Order Abstract Syntax Higher Order Abstract

693 views • 31 slides
CS453 Abstract Syntax tree (AST) Visitor patterns Plan for Today Abstract Syntax Tree

CS453 Abstract Syntax tree (AST) Visitor patterns Plan for Today Abstract Syntax Tree

CS453 Abstract Syntax tree (AST) Visitor patterns Plan for Today Abstract Syntax Tree Example and main idea construction with a bottom up parser AST for Meggy Java Visitor Design Pattern main idea and example example reprise

374 views • 14 slides
A Domain Specific Visual Language for Modelica Daniel Riegelhaupt - 20071521 What is Modelica ?

A Domain Specific Visual Language for Modelica Daniel Riegelhaupt - 20071521 What is Modelica ?

A Domain Specific Visual Language for Modelica Daniel Riegelhaupt - 20071521 What is Modelica ? Modelica is a freely available, dynamic (notion of time) declarative ( mathematical equations ) OO language for multi-domain modeling. 1 - OO

300 views • 25 slides
Modelica/Scicos Modelica : language for modeling physical systems. Originally continuous-time

Modelica/Scicos Modelica : language for modeling physical systems. Originally continuous-time

Hybrid dynamics in Modelica: should all events be considered synchronous Ramine Nikoukhah INRIA EOOLT 2007 Modelica/Scicos Modelica : language for modeling physical systems. Originally continuous-time modeling extended to discrete-time.

489 views • 12 slides
A different approach Operational semantics defines an interpreter, from abstract syntax to

A different approach Operational semantics defines an interpreter, from abstract syntax to

A different approach Operational semantics defines an interpreter, from abstract syntax to abstract syntax. Metalanguage is inference rules (slides) or OCaml ( interp.ml ) CSE-505: Programming Languages Denotational semantics defines a compiler

312 views • 3 slides
Abstract syntax trees COMP 520 Fall 2010 Abstract syntax trees (2) A compiler pass is a

Abstract syntax trees COMP 520 Fall 2010 Abstract syntax trees (2) A compiler pass is a

COMP 520 Fall 2010 Abstract syntax trees (1) Abstract syntax trees COMP 520 Fall 2010 Abstract syntax trees (2) A compiler pass is a traversal of the program. A compiler phase is a group of related passes. A one-pass compiler scans the program

592 views • 40 slides
Where we are abstract syntax tree syntax-directed translation (IR generation) CS 4120

Where we are abstract syntax tree syntax-directed translation (IR generation) CS 4120

Where we are abstract syntax tree syntax-directed translation (IR generation) CS 4120 intermediate code Introduction to Compilers syntax-directed translation (flattening) Andrew Myers reordering with traces canonical intermediate code

489 views • 4 slides
Abstract Syntax and Variable Binding (Extended Abstract) Marcelo Fiore Gordon Plotkin Daniele

Abstract Syntax and Variable Binding (Extended Abstract) Marcelo Fiore Gordon Plotkin Daniele

Abstract Syntax and Variable Binding (Extended Abstract) Marcelo Fiore Gordon Plotkin Daniele Turi COGS LFCS LFCS Univ. of Sussex Univ. of Edinburgh Univ. of Edinburgh Abstract inverse is analytic syntax. Finally, in the recursive

327 views • 10 slides
Syntax of FOL Definition 1 A contains the following symbols: 1. v 0 , v 1 , v 2 , . . .

Syntax of FOL Definition 1 A contains the following symbols: 1. v 0 , v 1 , v 2 , . . .

Computational Logic, Spring 2006 Pete Manolios Syntax of FOL Definition 1 A contains the following symbols: 1. v 0 , v 1 , v 2 , . . . (variables); 2. , , , , (boolean connectives); 3. , (quantifiers); 4. (equality

214 views • 9 slides
Visitors Unchained Using visitors to traverse abstract syntax with binding Franois Pottier WG

Visitors Unchained Using visitors to traverse abstract syntax with binding Franois Pottier WG

Visitors Unchained Using visitors to traverse abstract syntax with binding Franois Pottier WG 2.8, Edinburgh June 15, 2017 The problem Manipulating abstract syntax with binding requires many standard operations: opening and

1.04k views • 67 slides
Compiling Techniques Lecture 7: Abstract Syntax Christophe Dubach 2 October 2018 Christophe

Compiling Techniques Lecture 7: Abstract Syntax Christophe Dubach 2 October 2018 Christophe

Syntax Tree Abstract Syntax Tree AST Processing Compiling Techniques Lecture 7: Abstract Syntax Christophe Dubach 2 October 2018 Christophe Dubach Compiling Techniques Syntax Tree Abstract Syntax Tree AST Processing Table of contents 1

1.09k views • 33 slides
Compiling Techniques Lecture 7: Abstract Syntax Christophe Dubach 3 October 2017 Christophe

Compiling Techniques Lecture 7: Abstract Syntax Christophe Dubach 3 October 2017 Christophe

Syntax Tree Abstract Syntax Tree AST Processing Compiling Techniques Lecture 7: Abstract Syntax Christophe Dubach 3 October 2017 Christophe Dubach Compiling Techniques Syntax Tree Abstract Syntax Tree AST Processing Table of contents 1

642 views • 33 slides
Abstract Syntax Trees COMP 520: Compiler Design (4 credits) Professor Laurie Hendren

Abstract Syntax Trees COMP 520: Compiler Design (4 credits) Professor Laurie Hendren

COMP 520 Winter 2015 Abstract syntax trees (1) Abstract Syntax Trees COMP 520: Compiler Design (4 credits) Professor Laurie Hendren hendren@cs.mcgill.ca COMP 520 Winter 2015 Abstract syntax trees (2) What did we learn from assignment #1?

1.63k views • 32 slides
Parsing Input: Sequence of tokens Output: Abstract Syntax Tree CS 1622: Example: IF (

Parsing Input: Sequence of tokens Output: Abstract Syntax Tree CS 1622: Example: IF (

9/12/2012 Parsing Input: Sequence of tokens Output: Abstract Syntax Tree CS 1622: Example: IF ( ID(x) > NUM(3) ) { ID(y) INCREMENT ; } Syntax Analysis if-statement cond_expr stmt_list Jonathan Misurda >

255 views • 3 slides
Selection of variables in initialization of Modelica models Masoud Najafi INRIA ( French national

Selection of variables in initialization of Modelica models Masoud Najafi INRIA ( French national

Selection of variables in initialization of Modelica models Masoud Najafi INRIA ( French national research institute on computer and control ) Rocquencourt, France Outline The Modelica language in Scicos Initialization of Modelica models

243 views • 20 slides
CS453 Abstract Syntax tree (AST) Visitor Design Pattern Visitor patterns main idea and

CS453 Abstract Syntax tree (AST) Visitor Design Pattern Visitor patterns main idea and

Plan for Today Abstract Syntax Tree Example and main idea construction with a bottom up parser AST for Meggy Java CS453 Abstract Syntax tree (AST) Visitor Design Pattern Visitor patterns main idea and example example reprise

4.64k views • 4 slides
24) Exchange Syntax and Textual 3.Advanced features 1. Mapping text to data types DSLs using

24) Exchange Syntax and Textual 3.Advanced features 1. Mapping text to data types DSLs using

Outline 1.Introduction 2.How to build a DSL 1. Defining/Using a meta model 2. Syntax Definition 1. Generating an initial syntax (HUTN) 3. Refining the syntax 24) Exchange Syntax and Textual 3.Advanced features 1. Mapping text to data types

435 views • 14 slides
Scheme Syntax Program ::= { Definition | Expr } Shares many features with ML:

Scheme Syntax Program ::= { Definition | Expr } Shares many features with ML:

Scheme Syntax Program ::= { Definition | Expr } Shares many features with ML: expression-oriented Definition ::= list-oriented, garbage-collected heap-based (define id Expr ) functional | (define ( id fn id formal1 ... id formalN

431 views • 3 slides
Comparing the Performance of Abstract Syntax Notation One (ASN.1) vs. eXtensible Markup Language

Comparing the Performance of Abstract Syntax Notation One (ASN.1) vs. eXtensible Markup Language

Comparing the Performance of Abstract Syntax Notation One (ASN.1) vs. eXtensible Markup Language (XML) Presented By: Prof. D.W.Chadwick Other Author: D.Mundy Thanks to: ISSRG Information Systems Security Research Group Contact:

613 views • 20 slides

More recommend