modelling parsing and unparsing
play

Modelling Parsing and Unparsing Vadim Zaytsev Anya Helene Bagge - PowerPoint PPT Presentation

Oct 31, 2022 •48 likes •208 views

Modelling Parsing and Unparsing Vadim Zaytsev Anya Helene Bagge University of Amsterdam University of Bergen Parsing@SLE 2014-09-14 Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 1 / 10 SLE Artifacts String

  1. Modelling Parsing and Unparsing Vadim Zaytsev Anya Helene Bagge University of Amsterdam University of Bergen Parsing@SLE 2014-09-14 Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 1 / 10

  2. SLE Artifacts String ��������������� Parse Tree ������ ��� ������ ��� ������ ��� ���� ������ ���� ��� ��� ���� ������ ��� Token List ��� ��� ��� ������ ��� � ��� � ��� � � � ����� ���� ������ ��� ������ ���� ���� ��� �� ���� ���� ������ ����� ��� Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 2 / 10

  3. Te Megamodel m2m transformation structural editing Abstract visualise Lex Ast Dia (lexical model) (abstract syntax tree) (diagram) serialise e t e flatten d c d m2m a o o r l l p code transformation t p x m x Layoutless e e i parse TTk Cst Gra (typed tokens) unparse (concrete syntax tree) (graph model) format t t strip p a p a m m i i r r t t r r s o s o f f visual editing parse Layout refactoring Tok Ptr Dra (tokens) unparse (parse tree) (vector drawing) e t a e tokenise t u s r i a g e n c d i g n b n o m o e c c r a e scannerless parse s r i Raw d Str For Pic filtering drawing (string) unparse (parse forest) (rasterised picture) text editing Graphical Textual Structured Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 3 / 10

  4. Classic (Lex+Yacc) Parsing Abstract Lex Ast Dia (lexical model) (abstract syntax tree) (diagram) Layoutless parse TTk Cst Gra (typed tokens) (concrete syntax tree) (graph model) Layout Tok Ptr Dra (tokens) (parse tree) (vector drawing) scan Raw Str For Pic (string) (parse forest) (rasterised picture) Graphical Textual Structured Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 4 / 10

  5. Code Formatting Abstract Lex Ast Dia (lexical model) (abstract syntax tree) (diagram) Layoutless TTk Cst Gra (typed tokens) unparse (concrete syntax tree) (graph model) format Layout Tok Ptr Dra (tokens) (parse tree) (vector drawing) concat Raw Str For Pic (string) (parse forest) (rasterised picture) Graphical Textual Structured Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 5 / 10

  6. Rascal Abstract Lex Ast Dia (lexical model) (abstract syntax tree) (diagram) implode Layoutless TTk Gra (typed tokens) (figure) Cst render (concrete syntax tree) Ptr (parse tree) Layout Tok Dra unparse (tokens) (vector drawing) filter scannerless parse Raw Str For Pic (string) (parse forest) (rasterised picture) unparse Graphical Textual Structured Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 6 / 10

  7. Lowered Transformations Ast Ast transform Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 7 / 10

  8. Lowered Transformations Ast Ast transform implode explode Cst Cst transform Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 7 / 10

  9. Lowered Transformations Ast Ast transform implode explode Cst Cst transform format strip Ptr Ptr transform Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 7 / 10

  10. Lowered Transformations Ast Ast transform implode explode Cst Cst transform format strip Ptr Ptr transform unparse parse Str Str t r a n s f o r m Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 7 / 10

  11. Composing Transformations Abstract Lex Ast Dia (lexical model) (abstract syntax tree) (diagram) Layoutless TTk Cst Gra (typed tokens) unparse (concrete syntax tree) (graph model) format Layout Tok Ptr Dra (tokens) (parse tree) (vector drawing) concat Raw Str For Pic (string) (parse forest) (rasterised picture) Graphical Textual Structured Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 8 / 10

  12. Composing Transformations Abstract Lex Ast Dia (lexical model) (abstract syntax tree) (diagram) Layoutless TTk Cst Gra (typed tokens) unparse (concrete syntax tree) (graph model) format Layout Tok Ptr Dra (tokens) (parse tree) (vector drawing) concat Raw Str For Pic parse (string) (parse forest) (rasterised picture) Graphical Textual Structured Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 8 / 10

  13. Composing Transformations Abstract Lex Ast Dia (lexical model) (abstract syntax tree) (diagram) Layoutless TTk Cst Gra (typed tokens) unparse (concrete syntax tree) (graph model) format Layout Tok Ptr Dra (tokens) (parse tree) (vector drawing) concat filter Raw Str For Pic parse (string) (parse forest) (rasterised picture) Graphical Textual Structured Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 8 / 10

  14. Composing Transformations Abstract Lex Ast Dia (lexical model) (abstract syntax tree) (diagram) Layoutless TTk Cst Gra (typed tokens) unparse (concrete syntax tree) (graph model) format strip Layout Tok Ptr Dra (tokens) (parse tree) (vector drawing) concat filter Raw Str For Pic parse (string) (parse forest) (rasterised picture) Graphical Textual Structured Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 8 / 10

  15. Is it Useful? Explain representations and transformations to students Explain what you mean with “parsing” in your paper Simplify dealing with bidirectional transformations Amaze your friends with fancy graphic models in your papers Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 9 / 10

  16. Conclusion We have identified SLE artifacts and translations between them Prototype w/transformations: https://github.com/grammarware/bx-parsing The full paper: Vadim Zaytsev and Anya Helene Bagge. Parsing in a Broad Sense. In Jurgen Dingel and Wolfram Schulte, editors, Proceedings of the 17th International Conference on Model Driven Engineering Languages and Systems (MODELS’14), volume 8767 of LNCS, pages 50–67. Springer, 2014. Zaytsev & Bagge (UvA/UiB) Modelling Parsing and Unparsing 2014-09-14 10 / 10

Recommend

CSC 4181 Compiler Construction Parsing 1 1 Outline Top-down v.s. Bottom-up Top-down parsing

CSC 4181 Compiler Construction Parsing 1 1 Outline Top-down v.s. Bottom-up Top-down parsing

CSC 4181 Compiler Construction Parsing 1 1 Outline Top-down v.s. Bottom-up Top-down parsing Bottom-up parsing Recursive-descent Shift-reduce parsers parsing LR(0) parsing LL(1) parsing LR(0) items LL(1) parsing

429 views • 29 slides
Introduction to Bottom-Up Parsing Shift-reduce parsing The LR parsing algorithm

Introduction to Bottom-Up Parsing Shift-reduce parsing The LR parsing algorithm

Outline Review LL parsing Introduction to Bottom-Up Parsing Shift-reduce parsing The LR parsing algorithm Constructing LR parsing tables 2 Top-Down Parsing: Review Top-Down Parsing: Review Top-down parsing expands a

471 views • 13 slides
Unparsing (pretty printing) Prof. Dr. Ralf Lmmel Universitt Koblenz-Landau Software

Unparsing (pretty printing) Prof. Dr. Ralf Lmmel Universitt Koblenz-Landau Software

Unparsing (pretty printing) Prof. Dr. Ralf Lmmel Universitt Koblenz-Landau Software Languages Team Language processing patterns 1. The Chopper Pattern 2. The Lexer Pattern 3. The Copy/Replace Pattern 4. The Acceptor Pattern 5.

654 views • 20 slides
Top-Down Parsing Slides modified from Louden Book and Dr. Scherger Top Down Parsing A

Top-Down Parsing Slides modified from Louden Book and Dr. Scherger Top Down Parsing A

Compiler Design and Construction Top-Down Parsing Slides modified from Louden Book and Dr. Scherger Top Down Parsing A top-down parsing algorithm parses an input string of tokens by tracing out the steps in a leftmost derivation. Such an

1.12k views • 96 slides
Statistical Dependency Parsing in Korean: From Corpus Generation To Automatic Parsing Workshop on

Statistical Dependency Parsing in Korean: From Corpus Generation To Automatic Parsing Workshop on

Statistical Dependency Parsing in Korean: From Corpus Generation To Automatic Parsing Workshop on Statistical Parsing of Morphologically-Rich Languages 12th International Conference on Parsing Technologies Jinho D. Choi & Martha Palmer

199 views • 19 slides
Basic Parsing Algorithms Chart Parsing Seminar Recent Advances in Parsing Technology WS

Basic Parsing Algorithms Chart Parsing Seminar Recent Advances in Parsing Technology WS

Basic Parsing Algorithms Chart Parsing Seminar Recent Advances in Parsing Technology WS 2011/2012 Anna Schmidt Talk Outline Chart Parsing Basics Chart Parsing Algorithms Earley Algorithm CKY Algorithm Basics

1.12k views • 73 slides
Overview Introduction Lexicalized TAG, Advantages of parsing with LTAG Parsing LTAGs

Overview Introduction Lexicalized TAG, Advantages of parsing with LTAG Parsing LTAGs

Parsing with Lexicalized TAG (1) Extracting and comparing LTAG (2) Presentation by Philip John Gorinski Seminar Recent Advances in Parsing Technology Saarland University, Winter Term 2011/12 (1) Yves Shabes, Aravind K. Joshi, 1990 (2)

514 views • 36 slides
* 07/16/96 Plan for Today Shift-reduce parsing The problem with predictive top down parsing

* 07/16/96 Plan for Today Shift-reduce parsing The problem with predictive top down parsing

* 07/16/96 Plan for Today Shift-reduce parsing The problem with predictive top down parsing CS453 : Shift Reduce Parsing LR parsing: bottom up Unambiguous Grammars LR(0) and SLR Parse Tables Performs a right-most derivation in

316 views • 6 slides
1 Determinism and Parsing The parsing problem is, given a string w and a context-free grammar G ,

1 Determinism and Parsing The parsing problem is, given a string w and a context-free grammar G ,

1 Determinism and Parsing The parsing problem is, given a string w and a context-free grammar G , to decide if w L ( G ), and if so, to construct a derivation or a parse tree for w . Parsing is studied in courses in compilers. To be efficient

520 views • 12 slides
Bottom-up parsing LR parsing Construct parse tree for input from leaves up LR( k ) parsing

Bottom-up parsing LR parsing Construct parse tree for input from leaves up LR( k ) parsing

Bottom-up parsing LR parsing Construct parse tree for input from leaves up LR( k ) parsing reducing a string of tokens to single start symbol L eft-to-right scan of input, R ightmost derivation (inverse of deriving a string of tokens from

413 views • 5 slides
Bottom Up Parsing Also known as Shift-Reduce parsing More powerful than top down Dont

Bottom Up Parsing Also known as Shift-Reduce parsing More powerful than top down Dont

9/26/2012 Bottom Up Parsing Also known as Shift-Reduce parsing More powerful than top down Dont need left factored grammars Can handle left recursion Bottom Up Parsing Attempt to construct parse tree from an input string

655 views • 6 slides
Dependency Parsing & Feature-based Parsing Ling571 Deep Processing Techniques for NLP

Dependency Parsing & Feature-based Parsing Ling571 Deep Processing Techniques for NLP

Dependency Parsing & Feature-based Parsing Ling571 Deep Processing Techniques for NLP February 2, 2015 Roadmap Dependency parsing Graph-based dependency parsing Maximum spanning tree CLE Algorithm Learning

899 views • 87 slides
Statistical Parsing Parsing context-free languages ar ltekin University of Tbingen

Statistical Parsing Parsing context-free languages ar ltekin University of Tbingen

Statistical Parsing Parsing context-free languages ar ltekin University of Tbingen Seminar fr Sprachwissenschaft November 8, 2016 Recap Parsing basics CKY Earley Closing Ingredients of a (natural language) parser .

1.17k views • 51 slides
Generalised Parsing and Combinator Parsing A Happy Marriage? L. Thomas van Binsbergen

Generalised Parsing and Combinator Parsing A Happy Marriage? L. Thomas van Binsbergen

Conventional Parser Combinators Aspects of Generalised Parsing Combinators for Generalised Parsing Generalised Parsing and Combinator Parsing A Happy Marriage? L. Thomas van Binsbergen ltvanbinsbergen@acm.org Royal Holloway, University of

452 views • 30 slides
Robust Incremental Neural Semantic Graph Parsing Jan Buys and Phil Blunsom Dependency Parsing vs

Robust Incremental Neural Semantic Graph Parsing Jan Buys and Phil Blunsom Dependency Parsing vs

Robust Incremental Neural Semantic Graph Parsing Jan Buys and Phil Blunsom Dependency Parsing vs Semantic Parsing Dependency parsing models the syntactic structure between words in a sentence. Dependency Parsing vs Semantic Parsing

637 views • 31 slides
Statistical Parsing Dependency parsing ar ltekin University of Tbingen Seminar fr

Statistical Parsing Dependency parsing ar ltekin University of Tbingen Seminar fr

Statistical Parsing Dependency parsing ar ltekin University of Tbingen Seminar fr Sprachwissenschaft November 2016 Recap/background Dependency grammar Dependency parsing Evaluation Summary Ingredients of a parser

1.44k views • 89 slides
Plan for Today Predictive parsing as a specific subclass of recursive descent parsing

Plan for Today Predictive parsing as a specific subclass of recursive descent parsing

Plan for Today Predictive parsing as a specific subclass of recursive descent parsing complexity comparisons with general parsing might have to left-factor necessary to remove left-recursion (MiniSVG modification as example) Working

346 views • 5 slides
The Modelling and Simulation Process 1. History of Modelling and Simulation 2. Modelling and

The Modelling and Simulation Process 1. History of Modelling and Simulation 2. Modelling and

The Modelling and Simulation Process 1. History of Modelling and Simulation 2. Modelling and Simulation Concepts 3. Levels of Abstraction 4. Experimental Frame 5. Validation 6. Studying a mass-spring system 7. The Modelling and Simulation

692 views • 34 slides
Lectures 7 and 8. Parsing (syntax analysis) Wei Le 2015.9 Bottom Up Parsing Recognize many

Lectures 7 and 8. Parsing (syntax analysis) Wei Le 2015.9 Bottom Up Parsing Recognize many

Lectures 7 and 8. Parsing (syntax analysis) Wei Le 2015.9 Bottom Up Parsing Recognize many programming languages, used in practice More general, more powerful parser: less restrictions on grammars, e.g., can handle left-recursive grammar

680 views • 64 slides
LL1 Parsing a b $ S 1 A 4 B 3 2 a b b b 1. S --> a B

LL1 Parsing a b $ S 1 A 4 B 3 2 a b b b 1. S --> a B

LL1 Parsing a b $ S 1 A 4 B 3 2 a b b b 1. S --> a B Input 2. B --> 3. B --> A S 4. A --> b B Parse Stack Compare Input and Stacktop 1 LL1 Parsing a b $ S 1 A

694 views • 17 slides
Programming Languages: Parsing Onur Tolga S ehito glu Computer Engineering,METU 27 May

Programming Languages: Parsing Onur Tolga S ehito glu Computer Engineering,METU 27 May

Programming Languages:Parsing Programming Languages: Parsing Onur Tolga S ehito glu Computer Engineering,METU 27 May 2009 Programming Languages:Parsing Outline 1 Parsing Top-down Parsing Recursive Descent Parser LL Parsers

215 views • 8 slides
Models of Human Parsing Experimental Data 2 Informatics 2A: Lecture 22 Eye-tracking Reading

Models of Human Parsing Experimental Data 2 Informatics 2A: Lecture 22 Eye-tracking Reading

Human Parsing Human Parsing Experimental Data Experimental Data Bottom-Up Parser Bottom-Up Parser Left Corner Parser Left Corner Parser Human Parsing 1 Cognitive Constraints Garden Paths Dimensions of Parsing Models of Human Parsing

537 views • 9 slides
Top-Down Parsing Top-Down Parsing #1 Extra Credit Question Given this grammar G: E

Top-Down Parsing Top-Down Parsing #1 Extra Credit Question Given this grammar G: E

Top-Down Parsing Top-Down Parsing #1 Extra Credit Question Given this grammar G: E E + T E T T T * int T int T ( E ) Is the string int * (int + int) in L(G)? Give a derivation or prove that it

1.08k views • 61 slides
CKY Parsing Ling 571 Deep Processing Techniques for NLP January 12, 2011 Roadmap

CKY Parsing Ling 571 Deep Processing Techniques for NLP January 12, 2011 Roadmap

CKY Parsing Ling 571 Deep Processing Techniques for NLP January 12, 2011 Roadmap Motivation: Parsing (In) efficiency Dynamic Programming Cocke-Kasami-Younger Parsing Algorithm Chomsky Normal Form Conversion

689 views • 42 slides

More recommend