Appeared in IEEE Symposium on Visual Languages, VL99, Tokyo, 13-16 Septemberhttp://dlib.computer.org/conferen/vl/0216/pdfpdf Ambiguity in Visual Language Theory and its Role in Diagram Parsing Robert P.

Source URL: www.ccs.neu.edu

BRICS Basic Research in Computer Science BRICS RS-03-5 Christensen et al.: Precise Analysis of String Expressions

Source URL: www.brics.dk

• Software engineering
• Context-free grammar
• Formal grammar
• Terminal and nonterminal symbols
• Regular grammar
• Production
• Regular expression
• Static single assignment form
• Parsing expression grammar
• Formal languages
• Combinatorics
• Mathematics

TEX in Teaching Michael Moortgat, Richard Moot, Dick Oehrle Contents

Source URL: www.ntg.nl

• Programming language theory
• Compiler construction
• Prolog
• Computational linguistics
• Logic
• Parsing
• Formal sciences
• Software engineering
• Science

A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles Reid Swanson and Andrew S. Gordon Institute for Creative Technologies University of Southern CaliforniaFiji Way, Marina del Rey, CAUS

Source URL: people.ict.usc.edu

• Formal languages
• Compiler construction
• Syntax
• Parsing
• Parse tree
• Dependency grammar
• Treebank
• Semantic role labeling
• Formal grammar
• Linguistics
• Computational linguistics
• Grammar

A Nanopass Framework for Commercial Compiler Development Andrew W. Keep R. Kent Dybvig

Source URL: www.andykeep.com

• Compiler construction
• Procedural programming languages
• Programming language implementation
• Compilers
• Parsing
• Compiler
• Static single assignment form
• Code generation
• Chez Scheme
• Software engineering
• Computing
• Computer programming

Building a Semantic Parser Overnight Yushi Wang∗ Stanford University Jonathan Berant∗ Stanford University

Source URL: nlp.stanford.edu

• Language
• Theoretical computer science
• Computational linguistics
• Categorial grammar
• Formal grammar
• Parsing
• Syntax
• Semantics
• Boolean algebra
• Formal languages
• Linguistics
• Grammar

The Halting Problems of Network Stack Insecurity Le n S a s s a m a n , M e r e d i t h L . P a t t e r s o n , Se r g e y B r a t u s , and Anna Shubina Len Sassaman was a PhD

Source URL: static.usenix.org

• Computability theory
• Models of computation
• Turing machine
• Theory of computation
• Turing completeness
• Halting problem
• Universal Turing machine
• Parsing
• Deterministic pushdown automaton
• Theoretical computer science
• Computer science
• Applied mathematics

Testing and Modeling Dependencies Between a Network and Nodal Attributes Bailey K. Fosdick1 and Peter D. Hoff1,2 Working Paper no. 131 Center for Statistics and the Social Sciences University of Washington

Source URL: www.csss.washington.edu

• Compiler construction
• Parsing
• Software engineering
• Education
• Computing
• Attribute Hierarchy Method
• Network science
• Programming paradigms
• Network theory
• Attribute grammar

2005 Paper 4 Question 1 Compiler Construction (a) A (phrase-structured) grammar is often defined to be a 4-tuple (N, T, R, S) where R is a set of production rules. Explain what the other components of the 4-tuple are. E

Source URL: www.cl.cam.ac.uk

• Computing
• Programming language implementation
• Compiling tools
• Compiler construction
• Acronyms
• Yacc
• Lex
• Parsing
• Formal grammar
• Formal languages
• Software
• Parser generators

Light Regular Medium SemiBold Bold ExtraBold

Source URL: a2-type.co.uk

• Theoretical computer science
• Regular language
• Formal grammar
• Chomsky hierarchy
• Regular grammar
• Regular expression
• Programming language
• Parsing
• Cyrillic script
• Formal languages
• Combinatorics
• Mathematics