Syntax checking either way (Q2164743)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Syntax checking either way	scientific article

Statements

scholarly article

0 references

Syntax checking either way (English)

0 references

0 references

0 references

publication date

16 August 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-07469-1_10

0 references

0 references

Economy of description by parsers, DPDA's, and PDA's

0 references

Deterministic context free languages

0 references

Finite-Turn Pushdown Automata

0 references

Measuring nondeterminism in pushdown automata

0 references

A pushdown automaton or a context-free grammar - which is more economical?

0 references

The Unsolvability of the Recognition of Linear Context-Free Languages

0 references

0 references

0 references

0 references

0 references

On the translation of languages from left to right

0 references

Top-down syntax nalysis

0 references

Context-dependent nondeterminism for pushdown automata

0 references

On the size of parsers and \(\text{LR}(k)\)-grammars

0 references

Lower bounds on the size of deterministic parsers

0 references

A note on the succinctness of descriptions of deterministic languages

0 references

Identifiers

10.1007/978-3-031-07469-1_10

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2164743

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2164743&oldid=36842314"