Euler
From MaRDI portal
Software:52030
swMATH36328MaRDI QIDQ52030FDOQ52030
Author name not available (Why is that?)
Cited In (26)
- A transitive closure algorithm
- Multipass precedence analysis
- A basic course on compiler principles
- A sentence generator for testing parsers
- Ambiguity and precedence in syntax description
- Generalized overlap resolvable grammars and their parsers
- Generalization learning techniques for automating the learning of heuristics
- Semantic preserving translations
- Title not available (Why is that?)
- Epsilon weak precedence grammars and languages
- Translation grammars for compilation and decompilation
- A survey of state vectors
- The size of LALR (1) parsers
- SR(s,k) parsers: A class of shift-reduce bounded-context parsers
- A note on weak operator precedence grammars
- A note on weak operator precedence grammars
- Title not available (Why is that?)
- Quantitative fuzzy semantics
- Beyond operator-precedence grammars and languages
- Construction of recognition devices for regular languages from their Backus Normal Form definition
- On the 'correct prefix property' in precedence parsers
- Erratum to ``On the 'correct prefix property' in precedence parsers
- Pair grammars, graph languages and string-to-graph translations
- Precedence technique is not worse than SLR(1)
- A graph theory oriented extension to ALGOL
- Soft precedence
This page was built for software: Euler
