Expression engine user upload files jobs

Filter

My recent searches
Filter by:
Budget
to
to
to
Skills
Languages
    Job State
    7,479 expression engine user upload files jobs found, pricing in USD

    Implementation of a compiler using Java, gradle wrapper project, ANLTR4 Grammar expression. There will be an input expressions and an output will be Abstract Syntax Tree of literal expressions in form of grail library - graphs. yEd graph editor is needed to display the output results and to make it possible a .jar file library for java to integrate

    $260 (Avg Bid)
    $260 Avg Bid
    16 bids

    ...cases, legislation, constitutional provisions, and scholarly commentary, in order to render an accurate assessment of the protection afforded to the freedom of expression: “Freedom of expression [...] is applicable not only to 'information' or 'ideas' that are favourably received or regarded as inoffensive or as a matter of indifference, but also to thos...

    $186 (Avg Bid)
    $186 Avg Bid
    30 bids

    Design a panda head, as seen in the URL below. Requirements: - minimalistic - modern feel - neutral expression - needs to look good on a black and a white t-shirt colors. [url removed, login to view]

    $100 (Avg Bid)
    $100 Avg Bid
    90 entries

    Hi, I have a expression that you need to help me simplify to the simplest form using boolean algebra laws like commutative etc.

    $21 (Avg Bid)
    $21 Avg Bid
    10 bids

    Trying to develop a Windows desktop application using C# code....streaming functionality. We have already implemented that functionality using Microsoft Expression Encoder. But we need to implement this functionality without installing any additional software on the client machine. We are ready to use any third party .dll files. Need full source code.

    $339 (Avg Bid)
    $339 Avg Bid
    4 bids

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA.

    $134 (Avg Bid)
    $134 Avg Bid
    8 bids

    developing C++ program to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into an equivalent minimized DFA. 3- Building a DFA for a given regular expression directly without going through an NFA. 4- Implementing the LL(1) algorithm for a given context free grammar. also i want

    $20 / hr (Avg Bid)
    $20 / hr Avg Bid
    6 bids

    ...looking for an interesting point of view for a particular subject of interest. Robert Gilpin argued in "The Challenge of Global Capitalism" that liberal governance is an expression of the power and preferences of the United States. I'd like for you to apply the example of the International Monetary Fund to support this statement. Here's what I'm

    $186 (Avg Bid)
    $186 Avg Bid
    54 bids

    Implementation of a compiler using Java, gradle wrapper project, ANLTR4 Grammar expression. There will be an input expressions and an output will be Abstract Syntax Tree of literal expressions in form of grail library - graphs. yEd graph editor is needed to display the output results and to make it possible a .jar file library for java to integrate

    $216 (Avg Bid)
    $216 Avg Bid
    6 bids

    Implementation of a compiler using Java, gradle wrapper project, ANLTR4 Grammar expression. There will be an input expressions and an output will be Abstract Syntax Tree of literal expressions in form of grail library - graphs. yEd graph editor is needed to display the output results and to make it possible a .jar file library for java to integrate

    $244 (Avg Bid)
    $244 Avg Bid
    10 bids

    I want someone writes 15 conversations. the conversations should be at the level of pre-intermediate to intermediate. the length of...at the level of pre-intermediate to intermediate. the length of each conversation should be between 300 - 500 words. the writers will be provided with the vocabulary and expression lists. A sample word list is attached.

    $63 (Avg Bid)
    $63 Avg Bid
    33 bids

    ...two POST variables called 'equation' and 'type' - for type == 'simplify', take the value of 'expression' and perform [url removed, login to view](expression); - for type == 'solve', take the value of 'expression' and perform [url removed, login to view](expression); In each case, send the output to the ...

    $267 (Avg Bid)
    $267 Avg Bid
    5 bids

    Overview Using the Drupal 8 Field Validation module we need to validate the format of a field against the format of a reference number issued by the Master of the High Court of South Africa. Criteria Number issued by the Master of the High Court of South Africa (See more :[url removed, login to view]) Example reference: G549/17 Consists of 4 parts: 1. 1 or 2 Letters 2. Numb...

    $202 (Avg Bid)
    $202 Avg Bid
    9 bids

    Wow ! The expression by the result of the measure of length, length is the limit. Today you are invited to join, join a product launch that will not disapoint the seller, the buyer, nor the prospecting eye. With your work, with your skill we together can bring a product to market, a market to build upon the brand awarness. Objection

    $42178 (Avg Bid)
    $42178 Avg Bid
    1 bids

    Implementation of a compiler using Java, gradle wrapper project, ANLTR4 Grammar expression. There will be an input expressions and an output will be Abstract Syntax Tree of literal expressions in form of grail library - graphs. yEd graph editor is needed to display the output results and to make it possible a .jar file library for java to integrate

    $192 (Avg Bid)
    $192 Avg Bid
    8 bids

    a-Develop Java or C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. b- For the following grammar write a Java or C++ program that uses the LR(1) method to decide whether a

    $45 (Avg Bid)
    $45 Avg Bid
    8 bids

    a-Develop Java or C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. b- For the following grammar write a Java or C++ program that uses the LR(1) method to decide whether a

    $51 (Avg Bid)
    $51 Avg Bid
    7 bids
    Compiler code 2 days left

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. The code should be provided by clear explanation. Also, I will need a call session to explain the code .in one or tow days

    $69 (Avg Bid)
    $69 Avg Bid
    9 bids

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. The code should be provided by clear explanation. Also, I will need a call session to explain the code . Thanks

    $60 (Avg Bid)
    $60 Avg Bid
    1 bids

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA.

    $110 (Avg Bid)
    $110 Avg Bid
    18 bids