Ambiguous grammars

Part 1 of ebook "Compiler design in C" presents the following content: basic concepts; representing computer languages; a recursive-descent expression compiler; input and lexical analysis; context-free grammars; top-down parsing; bottom-up parsing; sentences, phrases, and context-free grammars; ambiguous grammars; augmented grammars and table-driven parsers;...

462p dieptieuung 14-07-2023 9 5   Download

This paper reports on the study that analyzed the type of ambiguous structures which cause the most difficulty to Vietnamese linguistics students to identify whether the learned syntactic knowledge could help them interpret these types. The study was conducted by quantitative method including surveys. Besides, qualitative one involved interviews.

10p vighostrider 01-06-2023 9 4   Download

The findings show that there are significant differences in terms of lexico-grammatical choices and process selections in transitivity system relating to translating indeterminate behavioral clauses with ambiguous and “dumb” processes, as well as understanding behavioral clause complex from English to Vietnamese.

6p vispyker 16-11-2022 24 3   Download

Lecture Compiler construction: Lesson 12 - Sohail Aslam. The main topics covered in this chapter include: Parse trees, precedence and these two derivations point out a problem with the grammar, xreate a non-terminal for each level of precedence, isolate corresponding part of grammar,...

54p youzhangjing_1909 28-04-2022 12 1   Download

Lecture Compiler construction: Lesson 28 - Sohail Aslam. The main topics covered in this chapter include: LR(1) skeleton parser, Shift/Reduce conflicts, ambiguities in the grammar, typical action shift so that else matches with most recent, DFA state containing,...

22p youzhangjing_1909 28-04-2022 12 1   Download

Lecture Compiler construction: Lesson 29 - Sohail Aslam. The main topics covered in this chapter include: Shift/Reduce conflicts, Consider of the ambiguous grammar, Reduce/Reduce conflicts, gross ambiguity in the grammar, LR(1) table size, LR(1) parsing table, LALR states,...

27p youzhangjing_1909 28-04-2022 10 1   Download

Lecture Theory of Automata: Lesson 34. The main topics covered in this chapter include: example of ambiguous grammar, example of unambiguous grammer (PALINDROME), total language tree with examples (finite and infinite trees), regular grammar, FA to CFG, semi word and Word, defining regular grammar, method to build TG for regular grammar,...

20p wangziyi_1307 26-04-2022 15 2   Download

This chapter presents the following content: Syntax director translator, syntax definition, context free grammars, derivations, parse trees, ambiguity, associativity of operators, operator precedence.

39p larachdumlanat126 31-12-2020 22 1   Download

The aim of this paper is to find out differences between definite ‘the’ and generic ‘the’ from traditional grammar to cognitive grammar concepts in order to help learners certainly understand when they use or analyze ‘the’ for an instance, and overcome the ambiguity.

7p tocectocec 19-05-2020 7 0   Download

A grammar can be used to define associativity and precedence among the operators in an expression. A grammar is ambiguous if one of its strings has two or more diffferent parse trees. Chapter 2b provides knowledge of grammars: Associativity and precedence, ambiguous grammars.

16p thiendiadaodien_8 24-02-2019 7 0   Download

(BQ)Tài liệu Introduction to automata theory, languages and compution have used chapter 1 through 8 for a senior-level course, omiting only the material on inherent ambiguity in chapter 4 an portion of chapter 8. Chapter 7, 8, 12 and 13 form the nu cleus of couse on computation complexity. An advanced course on language theory could be buil around chapter 2 through 7, 9 through 11 and 14.

426p miragevn 06-10-2014 80 5   Download

We are concerned with grammar-based surfacesyntactic analysis of running text. Morphological and syntactic analysis is here based on tags that express surface-syntactic relations between functional categories such as Subject, Modifier, Main verb etc.; consider the following simple sentence:

1p buncha_1 08-05-2013 26 1   Download

W e are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurally unresolvable distinctions in order to optimise on the accuracy of the parser, it also is beneficial for the g r a m m a r i a n to have as expressive a structural representation available as possible.

10p buncha_1 08-05-2013 52 2   Download

One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which are implausible. In order to deal with ambiguity, the MORphological PArser MORPA is provided with a probabilistic context-free grammar (PCFG), i.e. it combines a "conventional" context-free morphological grammar to filter out ungrammatical segmentations with a probability-based scoring function which determines the likelihood of each successful parse. ...

10p buncha_1 08-05-2013 43 2   Download

Natural language systems based on Categorial Unification Grammar (CUG) have mainly employed bottomup parsing algorithms for processing. Conventional prediction techniques to improve the efficiency of the • parsing process, appear to fall short when parsing CUG. Nevertheless, prediction seems necessary when parsing grammars with highly ambiguous lexicons or with noncanonical categorial rules. In this paper we present a lexicalist prediction technique for CUG and show thai this may lead to considerable gains in efficiency for both bottom-up and top-down parsing. ...

6p buncha_1 08-05-2013 51 1   Download

Givcn a grammar for a language, it is possible to create finite state mechanisms that approximate its recognition capacity. These simple automata consider only short context information~ drawn from local syntactic constraints which the grammar hnposes. While it is short of providing the strong generative capacity of the grammar, such an approximation is useful for removing most word tagging ambiguities, identifying many cases of iU-fonncd input, and assisting efficiently in othcr natural language processing tasks. ...

6p buncha_1 08-05-2013 42 2   Download

To account for the semi-free word order of French, Unification Categorial Grammar is extended in two ways. First, verbal valencies are contained in a set rather than in a list. Second, type-raised NP's are described as two-sided functors. The new framework does not overgenerate i.e., it accepts all and only the sentences which are grammatical. This follows partly from the elimination of false lexical ambiguities - i.e.

7p buncha_1 08-05-2013 39 2   Download

From a processing point of view, however, flexible categorial systems are problematic, since they introduce spurious ambiguity. In this paper, we present a flexible categorial grammar which makes extensive use of the product-operator, first introduced by Lambek (1958). The grammar has the property that for every reading of a sentence, a strictly left-branching derivation can be given. This leads to the definition of a subset of the grammar, for which the spurious ambiguity problem does not arise and efficient processing is possible. ...

8p buncha_1 08-05-2013 46 1   Download

We investigate the problem of determining a compact underspecified semantical representation for sentences that may be highly ambiguous. Due to combinatorial explosion, the naive method of building semantics for the different syntactic readings independently is prohibitive. We present a method that takes as input a syntactic parse forest with associated constraintbased semantic construction rules and directly builds a packed semantic structure. The algorithm is fully implemented and runs in O(n4log(n)) in sentence length, if the grammar meets some reasonable 'normality' restrictions. ...

8p bunthai_1 06-05-2013 53 3   Download

We describe the modification of a grammar to take advantage of prosodic information provided by a speech recognition system. This initial study is limited to the use of relative duration of phonetic segments in the assignment of syntactic structure, specifically in ruling out alternative parses in otherwise ambiguous sentences. Taking advantage of prosodic information in parsing can make a spoken language system more accurate and more efficient, if prosodicsyntactic mismatches, or unlikely matches, can be pruned. ...

6p bungio_1 03-05-2013 38 2   Download