Okinawan Awamori is produced by fermenting steamed indica rice with black mold, yeast, and water. Awamori-pressed lees is a by-product of the Awamori production process. Tofu lees is a by-product of the Tofu production process. This research consisted of two experiments conducted to elucidate whether or not dried Awamori-pressed lees and Tofu lees can be used as a mixed feed ingredient for rais...

We present here the proof for an alternative procedure to convert a Push Down Automata (PDA) into a Context Free Grammar (CFG). The procedure involves intermediate conversion to a single state PDA. In view of the authors, this conversion is conceptually simpler than the approach presented in [1] and can serve as a teaching aid for the relevant topics. For details on CFG and PDA, the reader is r...

We study the minimum concave cost flow problem over a two-dimensional grid network (CFG), where one dimension represents time (1 ≤ t ≤ T ) and the other dimension represents echelons (1 ≤ l ≤ L). The concave function over each arc is given by a value oracle. We give a polynomial-time algorithm for finding the optimal solution when the network has a fixed number of echelons and all sources lie a...

Unresolved indirect branch instructions are a major obstacle for statically reconstructing a control flow graph (CFG) from machine code. If static analysis cannot compute a precise set of possible targets for a branch, the necessary conservative over-approximation introduces a large amount of spurious edges, leading to even more imprecision and a degenerate CFG. In this paper, we propose to lev...

Experiments point at the need for a robust grammatical analysis on recognition results. A robust parsing can rst, help distinguish the incorrect recognitions that are recoverable; second, produce a relevant analysis for the interpretation process. We review existing robust parsing techniques and propose an approach based on Lexicalized Tree Grammars. We report experiments conducted on \Virtual ...

Myanmar language and script are unique and complex. Up to our knowledge, considerable amount of work has not yet been done in describing Myanmar script using formal language theory. This paper presents manually constructed context free grammar (CFG) with “111” productions to describe the Myanmar Syllable Structure. We make our CFG in conformity with the properties of LL(1) grammar so that we ca...

Large-scale grammars are a prerequisite for parsing a great variety of sentences, but it is difficult to build such grammars by hand. Yet, it is possible to derive a context-free grammar(CFG) automatically from an existing large-scale, syntactically annotated corpus. While being seemingly a simple task at first sight, CFGs derived in such a fashion have hardly ever been applied to an existing s...

Control Flow Graph (CFG) is a compact representation of all executable paths of a program and it is central to most program analyses. Unfortunately, the direct use of a CFG has two major sources of imprecision: (a) the existence of infeasible paths, and (b) the merging of states along incoming edges of a control-flow merge. Addressing these two problems is the path-sensitivity issue, and it is ...

This research explores the impact of Context Free Grammars (CFG) and Parse Trees for construction of a Telugu Language Sentences. Based on the CFG here we derived the derivations for the respective strings. Later we constructed the Parser Trees for the above said strings. Finally we analysed whether the string is ambiguous or unambiguous. Here for analysis we considered the Large Scale Open Sou...

Constructive methods for obtaining regular grammar counterparts for some sub-classes of context-free grammars (CFGs) have been investigated by many researchers. An important class of grammars for which this is always possible is the one-letter CFG. We show in this paper a new constructive method for transforming an arbitrary one-letter CFG to an equivalent regular expression of star-height 0 or...