"This paper deals with the preparation of a sentence for parallel parsing.  Preparation of a sentence consists in searching of substrings, which can be parsed independently. It tries to search criteria of choosing the substrings, so that it will bring high speed, maximal parallelism for parsing. It brings new way of searching substrings and makes an algorithm for automatic creation of automaton that makes decomposition based on a grammar."@en . "26230" . . . . "Dekompozice pro paraleln\u00ED syntaktickou anal\u00FDzu"@cs . "2002-04-25+02:00"^^ . "Decomposition for parallel parsing"@en . . . "186-188" . "80-214-2114-2" . . "Decomposition for parallel parsing" . "3"^^ . . "Tento \u010Dl\u00E1nek se zab\u00FDv\u00E1 p\u0159\u00EDpravou v\u011Bty jazyka pro paraleln\u00ED syntaktickou anal\u00FDzu. P\u0159\u00EDprava v\u011Bty se skl\u00E1d\u00E1 hled\u00E1n\u00ED pod\u0159et\u011Bzc\u016F, kter\u00E9 mohou b\u00FDt analyzov\u00E1ny nez\u00E1visle. Jsou prezentov\u00E1ny krit\u00E9ria, kter\u00E9 p\u0159in\u00E1\u0161\u00ED vysokou rychlost a maxim\u00E1ln\u00ED paralelismus syntaktick\u00E9 anal\u00FDzy. P\u0159in\u00E1\u0161\u00ED nov\u00FD zp\u016Fsob hled\u00E1n\u00ED pod\u0159et\u011Bzc\u016F a vytv\u00E1\u0159\u00ED algoritmy pro automatick\u00E9 vytv\u00E1\u0159en\u00ED automat\u016F, kter\u00E9 prov\u00E1d\u00ED dekompozici zalo\u017Eenou na gramatice.
"@cs . . "Vysok\u00E9 u\u010Den\u00ED technick\u00E9 v Brn\u011B" . . "RIV/00216305:26230/02:PU49494" . "Decomposition for parallel parsing"@en . . "Decomposition for parallel parsing" . "Proceedings of 8th conference and competition STUDENT EEICT 2002" . . "Brno" . . "decomposition, context-free languages, parallel parsing"@en . . "Brno" . . . "RIV/00216305:26230/02:PU49494!RIV06-MSM-26230___" . "Dekompozice pro paraleln\u00ED syntaktickou anal\u00FDzu"@cs . "1"^^ . "[DDCBFDBAF0AC]" . "Z(MSM6383917201)" . "This paper deals with the preparation of a sentence for parallel parsing.  Preparation of a sentence consists in searching of substrings, which can be parsed independently. It tries to search criteria of choosing the substrings, so that it will bring high speed, maximal parallelism for parsing. It brings new way of searching substrings and makes an algorithm for automatic creation of automaton that makes decomposition based on a grammar." . "1"^^ . "Ko\u0159enek, Jan" . "642300" . .