Expression engine cms jobs

Filter

My recent searches
Filter by:
Budget
to
to
to
Type
Skills
Languages
    Job State
    8,257 expression engine cms jobs found, pricing in USD

    You are to write a program that reads infix expressions from an input file, one expression per line, evaluates these expressions, and displays the original expressions together with their values, one per line, in an output file. The program is actually more complex than this as will be explained below. In this assignment, you will write an infix calculator

    $14 (Avg Bid)
    $14 Avg Bid
    4 bids

    ...help in fine tunnning some perl code, which is hard to explain by phone or by email. If you life in Chicago or suburb, please apply [otherwise please do not] perl regular expression is a must. C# or VB is a plus, but not a must. Heppy rentacoder Regards Alan ## Deliverables 1) Complete and fully-functional working program(s) in executable form as

    $42 (Avg Bid)
    $42 Avg Bid
    1 bids

    ...postfix evaluation using the following algorithm: algorithm postFixEvaluate (valexpr ) This algorith evaluates a postfix expression and returns its value pre: a valid expression post: postfix value computed return: value of expression 1 exprSize = lenght of string 2 stack = create Stack 3 index 4 loop (index <= exprSize) 1 if (expr[index] is operand) 1

    $22 (Avg Bid)
    $22 Avg Bid
    14 bids

    ...panel in the administrative section of PP. 4. More Flexible Search Facility Create the ability for visitors to search by category and by using more then one word in a logical expression. 5. Audio Module Give the visitor to PP the ability to select one of several(10-12) short 10 - 15 minute prerecorded essays. 6. Ease of Use and Security Think about the process

    PHP
    $798 (Avg Bid)
    $798 Avg Bid
    28 bids

    Need a regular expression genuis (perl type regexps) to help with our current project. Basically, regexps will be used for HTML manipulation and searching replacing data from one HTML file to another and so forth. Experience in Perl, ASP or PHP is a plus. ## Deliverables 1. Regular expressions as needed, completely working and bug free. (internal

    $187 (Avg Bid)
    $187 Avg Bid
    12 bids
    K-Map Ended

    ...selected. The user can then input the truth table which will generate the Karnaugh Map and Algebraic Expression or Fill in the Karnaugh Map which will create the Truth Table and Algebraic expression. The user then has the option to minimize the expression to it's simpliest form ## Deliverables 1) Complete and fully-functional working program(s) in executable

    $37 (Avg Bid)
    $37 Avg Bid
    12 bids

    ...choose from 2, 3 or 4 vaiable option. the user has the option to enter the data on a truth table or directly onto the Karnaugh map which in turn will generate the algebraic expression with the option to minimize to its simpliest form ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code

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

    Hi, I need 3 problems completed. Please see the attached Zip file for the descriptions and let me know if there are any questions. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete C++ source code of all work done. ## Platform Windows Microsoft Visual C++ version 6.0 .cpp extension

    $48 (Avg Bid)
    $48 Avg Bid
    2 bids

    This project deals with a simple kind of expression tree, where there are two kinds of nodes: * See Attached File For Complete Project Description * ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run

    $7 (Avg Bid)
    $7 Avg Bid
    1 bids

    ...copyrights to all work purchased. Hints A regular expression is first compiled with compile (). You will want to preserve this. But in ed.c, compile () is called with a single character that indicates what character will terminate the regular expression (for example, '/'); compile () collects the regular expression into a buffer by reading one character at

    $34 (Avg Bid)
    $34 Avg Bid
    3 bids

    A coomon way to represent a polynomial expression is with linked structures that have three members: (a) A member to represent the coefficient (b) A member to represent the exponent (c) A pointer to the next term in the expression Write the following program in C: 1. Write a function that expects pointers to two lists that represent polynomials and

    $13 (Avg Bid)
    $13 Avg Bid
    6 bids

    I need your help for extracting information from a htm file using regular expression in perl. If you can do it, I would like to pay you for lots of similar work in the very near future. I Attached the htm file. It shows four flight itineraries, I need to extract the "Date, Flight, Departing, Arriving, Stops, Duration and Total Fare" in each itinerary

    $11 (Avg Bid)
    $11 Avg Bid
    12 bids

    ...In this assignment you are to write a program that will differentiate expressions in the variable X. The input to this program will be a series, each representing an infix expression to be differentiated. Each such expressions is to be viewed as a stream of tokens. Valid tokens are integers, the variable X, the binary operators (+, -, *, /, ^), and parentheses

    $30 - $5000
    $30 - $5000
    0 bids

    ...each) -2 Queues and a stack of characters; for converting from infix to postfix -one for the original expression -one for temporary operator storage -one for holding the postfix expression -A stack of integers for evaluating the postfix expression -A link list of records (struct) for saving the variable values. Example: Input file A=5 B=10 C=A+B D=C*C

    $17 (Avg Bid)
    $17 Avg Bid
    3 bids

    Using VB.Net [login to view URL], I am looking for an expression that evalutes and matches only text that are within quote(") pairs, the following examples test of the regularexpression should be Input Results Hello World = No Match "Hello World" = Hello World " Hello World" = Hello World "Hello World " = Hello World " Hello World " = Hello World

    $24 (Avg Bid)
    $24 Avg Bid
    7 bids

    ...possible that the field contains white space so I tried filtering by TPNs.[Test Number] Is T* but that raised an error. Also tried TPNs.[Test Number]=T* How can I put an expression in the filter? The attached zip file is 900 KB. The form is called "Test procedures". ## Deliverables 1) Complete and fully-functional working program(s) in executable

    $6 (Avg Bid)
    $6 Avg Bid
    5 bids

    ...angle to its radian equivalent. This is necessary because the trigonometric functions, sin(x), cos(x), etc., require an angle argument (parameters) expressed in radians. The expression for converting an angle in degrees to its equivalent in radians is: Angle(in radians) = angle (in degrees) * Pi/180 where pi=3.1415926 for example an angle of 45 degrees

    $12 (Avg Bid)
    $12 Avg Bid
    8 bids

    Given ed.c file. Write a new version of grep and it may be called as "grep.c". Your version of grep must use that code for regular expression processing. You will have to throw away a fair amount, since your grep.c will not need more than about 400 lines; you should not need to add more than about 30 lines of your own code. Please see the attached

    $2 - $7
    $2 - $7
    0 bids

    ...1. <matrix> is a number between 0 and 9. This value is used as an index into an array of matrixtype. [login to view URL] main function must include a switch statement in which the case expression is a user defined enumeration type. This means that the command is recognized and its enumeration equivalent is sent back to be used in the case statement. [login to view URL] driver must

    $15 (Avg Bid)
    $15 Avg Bid
    3 bids

    ...processing notes! 1. is a number between 0 and 9. This value is used as an index into an array of matrixtype. [login to view URL] main function must include a switch statement in which the case expression is a user defined enumeration type. This means that the command is recognized and its enumeration equivalent is sent back to be used in the case statement. [login to view URL] driver mu...

    $13 (Avg Bid)
    $13 Avg Bid
    10 bids

    ...0 ??" 30, result -30 operation performed: -30 ??" 2, result -32 Final result: -32. Testing string: - 3 2 + 2 operation performed: 3 ??" 2, result 1 invalid expression, reached end of expression command: quit Testing complete. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of

    $17 (Avg Bid)
    $17 Avg Bid
    19 bids

    ...Horner (c, a0, a1, a2,...an: real numbers) y := an for i+ 1 to n y := y * c + + a(n-i) {y = a(n) c^(n) + a(n-1) c^ (n-1) + ... + a(1) c + a(0)} THE INPUT: 1. The polynomial expression [eg: 3x^(2) + x + 1]. 2. x = c [eg: x = 2] THE OUTPUT: 1. FOR CONVENTIONAL ALGORITHM (Should indicate on the output). The total number of multiplications and additions are

    $14 (Avg Bid)
    $14 Avg Bid
    3 bids

    Implement an interpreter for a Simple Mathematical Expression Language (Call it "SMEL," if you like. ;-) ). Permissible Implementation Languages: C, C++ or Java Description of the Language: =========================== Language Support for Operations and Functions: The language supports both unary and binary operations, along with some built-in functions

    $27 (Avg Bid)
    $27 Avg Bid
    12 bids

    Expression Evaluation using Stacks First, get the file [login to view URL] that will serve as your input. This is a file with each line being an integer algebraic expression that you will evaluate. Print each expression and its value, one per line. Setup an ADT Stack type (based on a linked list) so you can have a stack of integers whenever you need one. The expressions

    $69 (Avg Bid)
    $69 Avg Bid
    11 bids

    ...application. Goldmine 5.7 was selected as our new application. This uses primarily DBASE coding... We have some existing basic excel formulas from which we need the DBASE expression equivelent. Additionally we will need some basic DBASE expressions to be created. All of these formulas are fairly basic, and shouldn't be too challenging... There will be

    $52 (Avg Bid)
    $52 Avg Bid
    21 bids

    VISIO Developer/s wanted! Expression of Interest from very EXPEIRENCED MS-Visio developers wanted. At this stage just an EOI. Want to gadge the number of developers out there wanting to do this work. Project will begin in 6-10 weeks. If you are interested, then please let me know, and state relevant work expierence, and then I will forward work scope

    $1538 (Avg Bid)
    $1538 Avg Bid
    2 bids

    Hello, I need a very little piece of software to explore a Vbp/Vbg file that will be able to find and display all Subs/Functions included a Visual Basic Project using regular expression. This search will have to work in every configuration of the declaration of course. Here is a starting point for the query: Pattern for RegExp Query: "(Public|Private|( Friend*))(

    $58 (Avg Bid)
    $58 Avg Bid
    10 bids

    ...available for users from their desktop and from the Search Web option of their browsers. It should have these options: all keywords, any keyword, exact phrase, or Boolean expression Users should be able to validate selected results, save search history, and filter out pornography and foul language. Users should be able to set the closeness of the match

    $531 (Avg Bid)
    $531 Avg Bid
    4 bids

    ...at [login to view URL] Problem seems likely to have occured in the DB related to fish type function. Fish type in old DB was string, queries also used an expression vs. now fishtyp: ftype([fish type]) Should be a small bit of sql, but we need this, believe it or not ASAP Today! If you're interested let us know asap. Thanks Test set one:

    $55 (Avg Bid)
    $55 Avg Bid
    11 bids

    ...user to enter an expression in an infix such as enter uppercase no spaces :(A + B)*C-D*F+C +# please end the expression with a number signe warn the user if he enter the wrong way. the answer is AB+C*DF*-C i will attach a code is already done but it has few errors you can use it. ## Deliverables prompt the user to enter an expression in an infix such

    $22 (Avg Bid)
    $22 Avg Bid
    5 bids

    ...these to work for both summing at the detail level and subtotalling at the group level. ## Deliverables Example intelliprint solution and/or intelliprint field and/or expression code to handle summing and subtotalling that I can use to complete development of the report in our system. Complete copyrights to all work purchased. ## Platform Window

    $61 (Avg Bid)
    $61 Avg Bid
    2 bids

    ...seems to be far "pickier" about mixing variable types than VB is. As a result, I continually get AppForge compile-time error messages along the lines of "Cannot convert this expression from type 'Double' to type 'Long.' I need to talk on the telephone with someone about this, to 1) gain a high-level appreciation and understanding of what is happening, a...

    $641 (Avg Bid)
    $641 Avg Bid
    2 bids

    ...point values ( a set is one for the real member and one for the imaginary member). Must create the instances of the Complex number (using the set methods), display a simple expression of the addition operation (using the get methods), perform the addition operation and display the results. ## Deliverables Complete and fully-functional working program(s)

    $17 (Avg Bid)
    $17 Avg Bid
    20 bids

    First, get the file [login to view URL] that will serve as the input. This is a file with each line being an integer algebraic expression that you will evaluate. Print each expression and its value, one per line. Setup an ADT Stack type (based on a linked list) so you can have a stack of integers whenever you need one. The expressions consist of integer constants

    $33 (Avg Bid)
    $33 Avg Bid
    11 bids

    Hi, I attached the regular expression I use in one of my modules. It's pretty precise, however.. it's also pretty slow. I need someone who's good with regular expressions to tweak it, remove possible redundant checks, etc. I also need you to provide me with benchmark tests comparing my original regular expression with your new one. ## Deliverables

    $18 (Avg Bid)
    $18 Avg Bid
    4 bids

    This program will combine string manipulation, classes, and stacks. Using the stack class, write a program that evaluates an expression written in postfix notation. By definition to process postfix notation every time you reach an operator you perform that operation on the 2 previous operands. so: start processing your input string. If it is an operand

    $12 (Avg Bid)
    $12 Avg Bid
    28 bids

    ...values (a set is one for the real member and the one for the imaginary member). You must create the instances of the Complex number (using the set methods), display a simple expression of the addition operation (using the get methods), perform the addition operation and display the results. ## Deliverables Complete and fully-functional working program(s)

    $18 (Avg Bid)
    $18 Avg Bid
    20 bids

    ...which basically parses a comma seperated file and produces an output file in a different format, this program requires very good hands on experience in using perl regular expression and pattern matching features. when bidding tell me what is your expertise in these perl areas on an scale of 1 to 10 and will u be able to complete and test it in the time

    $95 (Avg Bid)
    $95 Avg Bid
    19 bids

    ...an (ordinary) calculator that uses "infix" arithmetic, ie. You type 1+2 and press = and you get 3. Assume that it supports +, -, * and / operations. Consider "Arithmetic Expression" (AE) to be a class in this example. Simple examples of AEs are 3+4, 6-5,7*8 and 9/10. Let's call these examples as PlusExpression (PE), MinusExpression (ME), TimesExpression

    $13 (Avg Bid)
    $13 Avg Bid
    8 bids
    Stack Ended

    Program 5 Stack Write a program that uses a stack to determine if grouping symbols, such as parentheses and braces, if an arithamtaic expression matches. For example, the expression (25 + ( 3 - 6 ) * 8) contains matching grouping symbols. If the expressiom conatains error, output an appropriate error message. I am posting the main and header code for

    $12 (Avg Bid)
    $12 Avg Bid
    9 bids

    Write a function to evaluate an expression tree t represented using the template structure BinaryTreeNode. Assume that each node has a field value that your procedure can use. The value field for nodes representing constants and variables contains the appropriate numeric value. For this project assume the permisible operators are binary +, -, *, / and

    $32 (Avg Bid)
    $32 Avg Bid
    3 bids

    ...postfix expression consisting of digits and operators into a character [login to view URL] should scan and evaluate the [login to view URL] algorithm is as follow: [login to view URL] the Null character('0')to the end of the prefix [login to view URL] the Null character is encountered,no further processing is needed. [login to view URL] '0'hasn't been encounter...

    $12 (Avg Bid)
    $12 Avg Bid
    13 bids

    Convert an ordinary infix arithmetic expression with single-digit integer such as (6+2)*5-8/4 to a postfix expression 62+5*84/-. The program should read the expression into character array "infix",and use stack functions to create the postfix expression in character array"postfix".The algorithm for creating a postfix is: 1 Push a '(' onto t...

    $11 (Avg Bid)
    $11 Avg Bid
    8 bids
    C++ Ended

    In this assignment you are to write a program that will differentiate expressions in the variable X. The input to this program will be a series, each representing an infix expression to be differentiated. Each such expressions is to be viewed as a stream of tokens. Valid tokens are integers, the variable X, the binary operators (+, -, *, /, ^), and parentheses

    $25 (Avg Bid)
    $25 Avg Bid
    7 bids

    ...highest precedence, followed by AND, then OR, which has the lowest precedence. Therefore, for the above example is equivalent to the fully parenthesized expression (p OR (q AND (NOT p))). (This expression evaluates to TRUE.) Associativity of the binary operators is left to right. Your main predicate should be named as eval and should take two lists as its

    $17 (Avg Bid)
    $17 Avg Bid
    1 bids

    ...postfix expression consisting of digits and operators into a character [login to view URL] should scan and evaluate the [login to view URL] algorithm is as follow: [login to view URL] the Null character('0')to the end of the prefix [login to view URL] the Null character is encountered,no further processing is needed. [login to view URL] '0'hasn't been encounter...

    $14 (Avg Bid)
    $14 Avg Bid
    33 bids

    Convert an ordinary infix arithmetic expression with single-digit integer such as (6+2)*5-8/4 to a postfix expression 62+5*84/-. The program should read the expression into character array "infix",and use stack functions to create the postfix expression in character array"postfix".The algorithm for creating a postfix is: 1 Push a '(' onto t...

    $14 (Avg Bid)
    $14 Avg Bid
    48 bids

    ...a program that will read in an expression and parse it. If the user enters: 3+4*5 print the answer is equal to 23. The following operators: * + - / are the only legal ones you need to check for. The program is to also take into account parentheses. Include nested and superfluous parentheses. Assume that an expression is no longer than 79 characters

    $27 (Avg Bid)
    $27 Avg Bid
    38 bids
    Stacks Ended

    ...of all work done. Complete copyrights to all work purchased.------ Write a program that will take a mathematical expression in INFIX notation, convert it to POSTFIX notation, and then evaluate the POSTFIX notation form of the expression. The program is to employ one or more STACKS with the EMPTY, PUSH and POP operations to complete the program. INPUT:

    $46 (Avg Bid)
    $46 Avg Bid
    26 bids

    ...highest precedence, followed by AND, then OR, which has the lowest precedence. Therefore, for the above example is equivalent to the fully parenthesized expression (p OR (q AND (NOT p))). (This expression evaluates to TRUE.) Associativity of the binary operators is left to right. Your main function should be named as eval and should take two lists as its

    $17 (Avg Bid)
    $17 Avg Bid
    1 bids